论文信息 - A Novel monotonization Transformation for Some Classes of Global Optimization Problems

A Novel monotonization Transformation for Some Classes of Global Optimization Problems

A novel monotonization method is proposed for converting a non-monotone programming problem into a monotone programming problem. An equivalent monotone programming problem with only inequality constraints is obtained via this monotonization method. Then the existing convexification and concavification methods can be used to convert the monotone programming problem into an equivalent better-structured optimization problem.

Zhi-You Wu | Fu-Sheng Bai | Zhiyou Wu | F. Bai

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

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

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

[4] Zhi-You Wu,et al. Convexification and Concavification for a General Class of Global Optimization Problems , 2005, J. Glob. Optim..

[5] Lian-sheng Zhang,et al. MONOTONIZATION IN GLOBAL OPTIMIZATION , 2005 .

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

[7] 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..

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

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

[10] P. Pardalos,et al. Recent developments and trends in global optimization , 2000 .

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