MONOTONIZATION IN GLOBAL OPTIMIZATION

被引：0

作者：

WU ZHIYOU BAI FUSHENG ZHANG LIANSHENG Department of Mathematics Chongqing Normal University Chongqing China School of Mathematical Sciences Pudan University Shanghai China Department of Mathematics Shanghai University Shanghai China ^{[400047
,200433
,200436
]}

机构：

来源：

ChineseAnnalsofMathematics | 2005年 / 03期

关键词：

Global optimization; Monotone programming problem; Monotonization;

D O I：

暂无

中图分类号：

O224 [最优化的数学理论];

学科分类号：

070105 ; 1201 ;

摘要：

<正>A general monotonization method is proposed for converting a constrained programming problem with non-monotone objective function and monotone constraint functions 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 concavefication methods can be used to convert the monotone programming problem into an equivalent better-structured optimization problem.

引用

页码：475 / 490

页数：16

共 4 条

[1] A convexification method for a class of global optimization problems with applications to reliability optimization [J].

Sun, XL ;

McKinnon, KIM ;

Li, D .

JOURNAL OF GLOBAL OPTIMIZATION, 2001, 21 (02) :185-199

[2] A METHOD FOR GLOBALLY MINIMIZING CONCAVE FUNCTIONS OVER CONVEX-SETS [J].

HOFFMAN, KL .

MATHEMATICAL PROGRAMMING, 1981, 20 (01) :22-32

[3] Convexification and concavification for a general class of global optimization problems [J].

Wu, ZY ;

Bai, FS ;

Zhang, LS .

JOURNAL OF GLOBAL OPTIMIZATION, 2005, 31 (01) :45-60

[4]

Convexification, Concavification and Monotonization in Global Optimization[J] . D. Li,X.L. Sun,M.P. Biswal,F. Gao. &nbspAnnals of Operations Research . 2001 (1)

← 1 →