Convexification and Concavification for a General Class of Global Optimization Problems期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Convexification and Concavification for a General Class of Global Optimization Problems

Authors:	Z.?Y.?Wu author-information" > author-information__contact u-icon-before" > mailto:zhiyouwu@.net" title=" zhiyouwu@.net" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author,F.?S.?Bai,L.?S.?Zhang

Affiliation:	(1) Department of Mathematics and Computer Science, Chongqing Normal University, Chongqing, 400047, China;(2) Department of Mathematics, Shanghai University, Baoshan, Shanghai, 200436, P.R. China;(3) Institute of Mathematics, Fudan University, Shanghai, 200433, P.R. China

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.

Keywords:	Concave minimization D.C. programming Global optimization Monotone programming Reverse convex programming
本文献已被 SpringerLink 等数据库收录！