A class of convexification and concavification methods for non-monotone optimization problems

Title: A class of convexification and concavification methods for non-monotone optimization problems
Creator: Wu, Zhiyou; Lee, Heung; Yang, Xin-Min
Date: 2005
Type: Text; Journal article
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/53621
Identifier: vital:954
Identifier: https://doi.org/10.1080/02331930500342807
Identifier: ISSN:0233-1934
Abstract: A class of convexification and concavification methods are proposed for solving some classes of non-monotone optimization problems. It is shown that some classes of non-monotone optimization problems can be converted into better structured optimization problems, such as, concave minimization problems, reverse convex programming problems, and canonical D.C. programming problems by the proposed convexification and concavification methods. The equivalence between the original problem and the converted better structured optimization problem is established.; C1
Publisher: Taylor & Francis
Relation: Optimization Vol. 54, no. 6 (2005), p. 605-625
Rights: Copyright Taylor & Francis
Rights: This metadata is freely available under a CCO license
Subject: 0802 Computation Theory and Mathematics; Concavification; Convexification; Global optimisation
Reviewed