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

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 problem...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Optimization Ročník 54; číslo 6; s. 605 - 625
Hlavní autori: Wu, Z. Y., Lee, H. W. J., Yang, X. M.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Philadelphia Taylor & Francis Group 01.12.2005
Taylor & Francis LLC
Predmet:
2000 MR Subject Classification: 90C30
Concavification
Convexification
Global optimization
Mathematical programming
Optimization
Optimization techniques
Problem solving
Studies
ISSN:0233-1934, 1029-4945
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0233-1934
1029-4945
DOI:10.1080/02331930500342807