Outer approximation algorithms for canonical DC problems

The paper discusses a general framework for outer approximation type algorithms for the canonical DC optimization problem. The algorithms rely on a polar reformulation of the problem and exploit an approximated oracle in order to check global optimality. Consequently, approximate optimality conditio...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of global optimization Ročník 46; číslo 2; s. 163 - 189
Hlavní autoři: Bigi, Giancarlo, Frangioni, Antonio, Zhang, Qinghua
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.02.2010
Springer Nature B.V
Témata:
Algorithms
Approximation
Computer Science
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Real Functions
Studies
Polar set
Cutting plane algorithms
DC problems
Approximate optimality conditions
ISSN:0925-5001, 1573-2916
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The paper discusses a general framework for outer approximation type algorithms for the canonical DC optimization problem. The algorithms rely on a polar reformulation of the problem and exploit an approximated oracle in order to check global optimality. Consequently, approximate optimality conditions are introduced and bounds on the quality of the approximate global optimal solution are obtained. A thorough analysis of properties which guarantee convergence is carried out; two families of conditions are introduced which lead to design six implementable algorithms, whose convergence can be proved within a unified framework.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-009-9415-1