Abstract
A kind of general convexification and concavification methods is proposed for solving some classes of global optimization problems with certain monotone properties. It is shown that these minimization problems can be transformed into equivalent concave minimization problem or reverse convex programming problem or canonical D.C. programming problem by using the proposed convexification and concavification schemes. The existing algorithms then can be used to find the global solutions of the transformed problems.
Similar content being viewed by others
References
H.P. Benson (1996) ArticleTitleDeterministic algorithm for constrained concave minimization: A unified critical surver Naval Research Logistics 43 765–795 Occurrence Handle10.1002/(SICI)1520-6750(199609)43:6<765::AID-NAV1>3.0.CO;2-2 Occurrence Handle1403729 Occurrence Handle0857.90099
K.L.A. Hoffman (1981) ArticleTitleA method for globally minimizing concave functions over convex set Mathematical Programing 20 22–23 Occurrence Handle10.1007/BF01589330 Occurrence Handle0441.90096
R. Horst (1990) ArticleTitleDeterministic methods in constrained global optimization: Some recent advances and new fields of application Naval Research Logistics 37 433–471 Occurrence Handle10.1002/1520-6750(199008)37:4<433::AID-NAV3220370403>3.0.CO;2-2 Occurrence Handle1066216 Occurrence Handle0709.90093
R Horst P.M. Pardalos N.V. Thoai (1996) Introduction to Global Optimization Springer US Dordrecht, Netherland
D. Li (1995) ArticleTitleZero duality gap for a class of nonconvex optimization problems Journal of Optimization Theory and Applications 85 309–324 Occurrence Handle10.1007/BF02192229 Occurrence Handle1333790 Occurrence Handle0829.90109
D. Li (1996) ArticleTitleConvexification of noninferior frontier Journal of Optimization Theory and Applications 88 177–196 Occurrence Handle10.1007/BF02192028 Occurrence Handle1367039 Occurrence Handle0842.90102
D Li X.L Sun M.P. Biswal F. Gao (2001) ArticleTitleConvexification, concavification and monotonization in global optimization Annals of operations Research 105 213–226 Occurrence Handle10.1023/A:1013313901854 Occurrence Handle1879426 Occurrence Handle0995.90091
D. Li X.L. Sun (2000) ArticleTitleLocal convexification of Lagrangian function in nonconvex optimization Journal of Optimization Theory and Applications 104 109–120 Occurrence Handle10.1023/A:1004628822745 Occurrence Handle1741392 Occurrence Handle0960.90070
P.M. Pardalos J.B. Rosen (1987) Constrained Global Optimization Springer-Verlag Berlin Occurrence Handle10.1007/BFb0000035 Occurrence Handle0638.90064
X.L. Sun K. McKinnon D. Li (2001) ArticleTitleA convexification method for a class of global optimization problem with application to reliability optimization Journal of Global Optimization 21 185–199 Occurrence Handle10.1023/A:1011962605464 Occurrence Handle1863332 Occurrence Handle1004.90050
H. Tuy (1998) Convex Analysis and Global Optimization Springer US Dordrecht/Boston/London Occurrence Handle10.1007/978-1-4757-2809-5 Occurrence Handle0904.90156
A. Mordecai (1976) Nonlinear Programming: Analysis and Methods Prentice-hall International, Inc. London Occurrence Handle0361.90035
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wu, Z.Y., Bai, F.S. & Zhang, L.S. Convexification and Concavification for a General Class of Global Optimization Problems. J Glob Optim 31, 45–60 (2005). https://doi.org/10.1007/s10898-004-0569-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-0569-6