Abstract
In this paper we derive necessary and sufficient conditions for some problems of global minimization. Our approach is based on methods of abstract convexity: we use a representation of an upper semicontinuous function as the lower envelope of a family of convex functions. We discuss applications of conditions obtained to the examination of some tractable sufficient conditions for the global minimum and to the theory of inequalities.
Similar content being viewed by others
References
Beck A. and Teboulle M. (2000). Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J. Optim. 11: 179–188
Dur M., Horst R. and Locatelli M. (1998). Necessary and sufficient global optimality conditions for convex maximization revisited. J. Math. Anal. Appl. 217(2): 637–649
Hiriart-Urruty J.-B. (1982). ɛ-subdifferential calculus. Convex analysis and optimization. Res. Notes Math. 57: 43–92
Hiriart-Urruty J.-B. (1998). Conditions for global optimality 2. J. Glob. Optim. 13: 349–367
Hiriart-Urruty J.-B. (2001). Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints. J. Glob. Optim. 21: 445–455
Hiriart-Urruty J.-B. and Lemarechal C. (1993). Convex Analysis and Minimnization Algorithms, II. Springer, Berlin
Hiriart-Urruty J.-B. and Ledyaev Y.A. (1996). Note on the characterization of the global maxima of a (tangentially) convex function over a convex set. J. Convex Anal. 3: 55–61
(1995). Handbook of Global Optimization, Nonconvex Optimization and its Applications. Kluwer, Dordrecht
Pallaschke D. and Rolewicz S. (1997). Foundations of Mathematical Optimization. Kluwer, Dordrechet
Pan X.-C. and Zheng Q. (1999). Global optimum shape design.. Comput. Math. Appl. 37: 151–162
Pinar M.C. (2004). Sufficient global optimality conditions for bivalent quadratic optimization. J. Optim. Theor. Appl. 122(2): 443–440
Rubinov A.M. (2000). Abstract Convexity and Global Optimization. Kluwer, Dordrecht
Rubinov A.M. and Glover B.M. (1999). Toland-Singer formula cannot discriminate a global minimizer from a choice of stationary points. Numer. Funct. Anal. Optim. 20: 99–120
Singer I. (1997). Abstract Convex Analysis. Wiley, New York
Strekalovsky A.S. (1998). Global optimality conditions for nonconvex optimization. J. Glob. Optim. 12: 415–434
Strekalovsky, A.S.: Elements of nonconvex optimization. Nauka, Novosibirsk (in Russian) (2003)
Tsevendorj I. (2001). Piecewice-convex maximization problems: global optimality conditions. J. Glob. Optim. 21: 1–14
Tuy H. (1998). Convex Analysis and Global Optimization. Kluwer, Dordrecht
Zalinescu C. (2002). Convex Analysis in General Vector Spaces. World Scientific, London
Author information
Authors and Affiliations
Corresponding author
Additional information
The work was supported by a grant from the Australian Research Council.
Rights and permissions
About this article
Cite this article
Rubinov, A.M., Wu, Z.Y. Optimality conditions in global optimization and their applications. Math. Program. 120, 101–123 (2009). https://doi.org/10.1007/s10107-007-0142-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-007-0142-4