A new global optimization method for univariate constrained twice-differentiable NLP problems

In this paper, a new global optimization method is proposed for an optimization problem with twice-differentiable objective and constraint functions of a single variable. The method employs a difference of convex underestimator and a convex cut function, where the former is a continuous piecewise concave quadratic function, and the latter is a convex quadratic function. The main objectives of this research are to determine a quadratic concave underestimator that does not need an iterative local optimizer to determine the lower bounding value of the objective function and to determine a convex cut function that effectively detects infeasible regions for nonconvex constraints. The proposed method is proven to have a finite ε-convergence to locate the global optimum point. The numerical experiments indicate that the proposed method competes with another covering method, the index branch-and-bound algorithm, which uses the Lipschitz constant.

[1]  C. Floudas,et al.  Global Optimization for the Parameter Estimation of Differential-Algebraic Systems , 2000 .

[2]  Gintautas Dzemyda,et al.  Stochastic and global optimization , 2002 .

[3]  S. A. Piyavskii.  An algorithm for finding the absolute extremum of a function , 1972 .

[4]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[5]  B. Wah,et al.  Handling inequality constraints in continuous nonlinear global optimization , 1996 .

[6]  P. Basso.  Iterative Methods for the Localization of the Global Maximum , 1982 .

[7]  C. Floudas,et al.  A global optimization approach for Lennard‐Jones microclusters , 1992 .

[8]  W. Baritompa,et al.  Equivalent Methods for Global Optimization , 1996 .

[9]  N. Sahinidis,et al.  Global optimization of nonconvex NLPs and MINLPs with applications in process design , 1995 .

[10]  B. Jaumard,et al.  On using estimates of Lipschitz constants in global optimization , 1990 .

[11]  Christodoulos A. Floudas,et al.  Computational Experience with a New Class of Convex Underestimators: Box-constrained NLP Problems , 2004, J. Glob. Optim..

[12]  Christodoulos A. Floudas,et al.  A New Class of Improved Convex Underestimators for Twice Continuously Differentiable Constrained NLPs , 2004, J. Glob. Optim..

[13]  Leo Breiman,et al.  A deterministic algorithm for global optimization , 1993, Math. Program..

[14]  Christodoulos A. Floudas,et al.  Trigonometric Convex Underestimator for the Base Functions in Fourier Space , 2005 .

[15]  C. Adjiman,et al.  Global optimization of mixed‐integer nonlinear problems , 2000 .

[16]  Nils Tönshoff,et al.  Implementation and Computational Results , 1997 .

[17]  Yaroslav D. Sergeyev,et al.  Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints , 2001, J. Glob. Optim..

[18]  Panos M. Pardalos,et al.  State of the Art in Global Optimization , 1996 .

[19]  D. Mayne,et al.  Outer approximation algorithm for nondifferentiable optimization problems , 1984 .

[20]  Christodoulos A. Floudas,et al.  Trilinear Monomials with Mixed Sign Domains: Facets of the Convex and Concave Envelopes , 2004, J. Glob. Optim..

[21]  R. Baker Kearfott,et al.  A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization , 1995, TOMS.

[22]  Yaroslav D. Sergeyev,et al.  Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints , 2011, Math. Program..

[23]  P. Pardalos,et al.  Handbook of global optimization , 1995 .

[24]  K. Ichida.  Constrained optimization using interval analysis , 1996 .

[25]  Christodoulos A. Floudas,et al.  Rigorous convex underestimators for general twice-differentiable problems , 1996, J. Glob. Optim..

[26]  C. Adjiman,et al.  A global optimization method, αBB, for general twice-differentiable constrained NLPs—II. Implementation and computational results , 1998 .

[27]  Christodoulos A. Floudas,et al.  Global optimization in the 21st century: Advances and challenges , 2005, Comput. Chem. Eng..

[28]  Christodoulos A. Floudas,et al.  Two results on bounding the roots of interval polynomials , 1999 .

[29]  Christodoulos A. Floudas,et al.  A global optimization method, αBB, for process design , 1996 .

[30]  Pierre Hansen,et al.  Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison , 1989, Math. Program..

[31]  Juan M. Zamora,et al.  A global MINLP optimization algorithm for the synthesis of heat exchanger networks with no stream splits , 1998 .

[32]  Edward M. B. Smith,et al.  Global optimisation of nonconvex MINLPs , 1997 .

[33]  Yaroslav D. Sergeyev.  Global one-dimensional optimization using smooth auxiliary functions , 1998, Math. Program..

[34]  Christodoulos A. Floudas,et al.  αBB: A global optimization method for general constrained nonconvex problems , 1995, J. Glob. Optim..

[35]  D. Famularo,et al.  Test Problems for Lipschitz Univariate Global Optimization with Multiextremal Constraints , 2002 .

[36]  Christian Jansson,et al.  Quasiconvex relaxations based on interval arithmetic , 2001 .

[37]  Y. Sergeyev,et al.  Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives , 1999 .

[38]  C. Floudas.  Global optimization in design and control of chemical process systems , 1998 .

[39]  C. Floudas,et al.  A deterministic global optimization approach for molecular structure determination , 1994 .

[40]  Jasbir S. Arora,et al.  TWO ALGORITHMS FOR GLOBAL OPTIMIZATION OF GENERAL NLP PROBLEMS , 1996 .

[41]  I. D. L. Bogle,et al.  Global optimisation of constrained non-convex programs using reformulation and interval analysis , 1999 .

[42]  Christodoulos A. Floudas,et al.  Convex Underestimation of Twice Continuously Differentiable Functions by Piecewise Quadratic Perturbation: Spline αBB Underestimators , 2005, J. Glob. Optim..

[43]  Christodoulos A. Floudas,et al.  Global Optimization with Nonfactorable Constraints , 2002 .

[44]  A. Neumaier,et al.  A global optimization method, αBB, for general twice-differentiable constrained NLPs — I. Theoretical advances , 1998 .

[45]  Christodoulos A. Floudas,et al.  Deterministic Global Optimization: Theory, Methods and (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 37) (Nonconvex Optimization and Its Applications) , 2005 .

[46]  Christodoulos A. Floudas,et al.  Deterministic global optimization - theory, methods and applications , 2010, Nonconvex optimization and its applications.