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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization Jg. 66; H. 1; S. 129 - 147
Hauptverfasser:	An, Nguyen Thai, Nam, Nguyen Mau
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia Taylor & Francis 02.01.2017 Taylor & Francis LLC
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!