Convergence analysis of a proximal point algorithm for minimizing differences of functions

Several optimization schemes have been known for convex optimization problems. However, numerical algorithms for solving nonconvex optimization problems are still underdeveloped. A significant progress to go beyond convexity was made by considering the class of functions representable as differences...

Celý popis

Podrobná bibliografie

Vydáno v:	Optimization Ročník 66; číslo 1; s. 129 - 147
Hlavní autoři:	An, Nguyen Thai, Nam, Nguyen Mau
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia Taylor & Francis 02.01.2017 Taylor & Francis LLC
Témata:	Algorithms Computational geometry Convergence Convex analysis Convexity DC programming difference of convex functions Kurdyka-ᴌojasiewicz inequality Mathematical analysis Mathematical models Numerical analysis Optimization proximal point algorithm
ISSN:	0233-1934, 1029-4945
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!