A new global optimization method for univariate constrained twice-differentiable NLP problems
- 84 Downloads
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.
KeywordsGlobal optimization Difference of convex underestimator Convex cut function Univariate NLP
Unable to display preview. Download preview PDF.
- Famularo D., Sergeyev YA.D., Pugliese P. (2001). Test problems for Lipschitz univariate global opitmization with multiextremal constraints. In: Dzemyda G., Saltenis V., Zilinskas A. (eds). Stochastic and Global Optimization. Kluwer Academic Publishers, The NetherlandsGoogle Scholar
- Floudas C.A. (2000a) Deterministic Global Optimization: Theory, Methods and Application. Kluwer Academic Publishers, The NetherlandsGoogle Scholar
- Hansen P., Jaumard B. (1995). Lipschitz optimization. In: Horst R., Pardalos M.P. (eds). Handbook of Global Optimization. Kluwer Academic Publishers, The NetherlandsGoogle Scholar
- Horst R., Tuy H. (1996) Global Optimization: Deterministic Approaches. Springer-Verlag, BerlinGoogle Scholar
- Kim Y., Lee T. (2001) Acceleration of αBB global optimization algorithm using quadratic and linear underestimator. ESCAPE-11 Suppl. Proc. 35–40Google Scholar
- MacLagan D., Sturge T., Baritompa W.P. (1996). Equivalent methods for global optimization. In: Floudas C.A., Pardalos P.M. (eds). State of the Art in Global Optimization. Kluwer Academic Publishers, DordrechtGoogle Scholar
- Sergeyev Y.D. (1998) Global one-dimensional optimization using smooth auxiliary functions. Math. Program. 81, 127–146Google Scholar
- Smith E.M.B., Pantelides C.C. (1997) Global optimization of nonconvex MINLPs. Comp. Chem. Engng. 21S, S791–S796Google Scholar
- Wang T., Wah B.W. (1996) Handling inequality constraints in continuous nonlinear global optimization. Integr. Design Process Technol. 267–274Google Scholar