Convexification and Concavification for a General Class of Global Optimization Problems

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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of global optimization Ročník 31; číslo 1; s. 45 - 60
Hlavní autori: Wu, Z. Y., Bai, F. S., Zhang, L. S.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Dordrecht Springer Nature B.V 01.01.2005
Predmet:
Algorithms
Convex analysis
Mathematical functions
Mathematics
Operations research
Optimization
Optimization techniques
Studies
ISSN:0925-5001, 1573-2916
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 DC 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. [PUBLICATION ABSTRACT]
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-004-0569-6