论文信息 - Convexification and Concavification for a General Class of Global Optimization Problems

Convexification and Concavification for a General Class of Global Optimization Problems

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.

[1] H. Tuy. Convex analysis and global optimization , 1998 .

[2] Duan Li,et al. Local Convexification of the Lagrangian Function in Nonconvex Optimization , 2000 .

[3] Panos M. Pardalos,et al. Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[4] Panos M. Pardalos,et al. Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[5] Duan Li,et al. Convexification, Concavification and Monotonization in Global Optimization , 2001, Ann. Oper. Res..

[6] Karla L. Hoffman,et al. A method for globally minimizing concave functions over convex sets , 1981, Math. Program..

[7] Reiner Horst,et al. Deterministic methods in constrained global optimization: Some recent advances and new fields of application , 1990 .

[8] Duan Li,et al. Convexification of a noninferior frontier , 1996 .

[9] Duan Li. Zero duality gap for a class of nonconvex optimization problems , 1995 .

[10] K. I. M. McKinnon,et al. A convexification method for a class of global optimization problems with applications to reliability optimization , 2001, J. Glob. Optim..

[11] Mordecai Avriel,et al. Nonlinear programming , 1976 .

[12] H. P. Benson. Deterministic algorithms for constrained concave minimization: A unified critical survey , 1996 .