A new deterministic global optimization method for general twice-differentiable constrained nonlinear programming problems

A deterministic global optimization method that is applicable to general nonlinear programming problems composed of twice-differentiable objective and constraint functions is proposed. The method hybridizes the branch-and-bound algorithm and a convex cut function (CCF). For a given subregion, the difference of a convex underestimator that does not need an iterative local optimizer to determine the lower bound of the objective function is generated. If the obtained lower bound is located in an infeasible region, then the CCF is generated for constraints to cut this region. The cutting region generated by the CCF forms a hyperellipsoid and serves as the basis of a discarding rule for the selected subregion. However, the convergence rate decreases as the number of cutting regions increases. To accelerate the convergence rate, an inclusion relation between two hyperellipsoids should be applied in order to reduce the number of cutting regions. It is shown that the two-hyperellipsoid inclusion relation is determined by maximizing a quadratic function over a sphere, which is a special case of a trust region subproblem. The proposed method is applied to twelve nonlinear programming test problems and five engineering design problems. Numerical results show that the proposed method converges in a finite calculation time and produces accurate solutions.

[1]  Philip B. Zwart,et al.  Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms , 1973, Oper. Res..

[2]  Klaus Schittkowski,et al.  Test examples for nonlinear programming codes , 1980 .

[3]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[4]  D. Sorensen.  Newton's method with a model trust region modification , 1982 .

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

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

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

[8]  Quan Zheng,et al.  Integral global minimization: Algorithms, implementations and numerical tests , 1995, J. Glob. Optim..

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

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

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

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

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

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

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

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

[17]  Jang-Ping Wang.  The UBST approach to the stress analysis of plane-strain upsetting with a newly constructed model of the slip-line field , 1996 .

[18]  Danny C. Sorensen,et al.  Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint , 1997, SIAM J. Optim..

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

[20]  Franz Rendl,et al.  A semidefinite framework for trust region subproblems with applications to large scale minimization , 1997, Math. Program..

[21]  Juan M. Zamora,et al.  Continuous global optimization of structured process systems models , 1998 .

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

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

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

[25]  Nicholas I. M. Gould,et al.  Solving the Trust-Region Subproblem using the Lanczos Method , 1999, SIAM J. Optim..

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

[27]  Lubomir V. Kolev,et al.  An interval method for global inequality-constraint optimization problems , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[28]  Ya-Xiang Yuan,et al.  A Robust Algorithm for Optimization with General Equality and Inequality Constraints , 2000, SIAM J. Sci. Comput..

[29]  William W. Hager,et al.  Minimizing a Quadratic Over a Sphere , 2001, SIAM J. Optim..

[30]  Danny C. Sorensen,et al.  A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem , 2000, SIAM J. Optim..

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

[32]  Tapabrata Ray,et al.  ENGINEERING DESIGN OPTIMIZATION USING A SWARM WITH AN INTELLIGENT INFORMATION SHARING AMONG INDIVIDUALS , 2001 .

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

[34]  R. Mayne,et al.  An approach to multi‐start clustering for global optimization with non‐linear constraints , 2002 .

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

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

[37]  Jung-Fa Tsai,et al.  Global optimization of nonlinear fractional programming problems in engineering design , 2005 .

[38]  Yushan Zhu,et al.  A Global Optimization Method, QBB, for Twice-Differentiable Nonconvex Optimization Problem , 2005, J. Glob. Optim..

[39]  Young-Cheol Park,et al.  A new global optimization method for univariate constrained twice-differentiable NLP problems , 2007, J. Glob. Optim..