An Accelerated Inexact Proximal Point Algorithm for Convex Minimization

The proximal point algorithm is classical and popular in the community of optimization. In practice, inexact proximal point algorithms which solve the involved proximal subproblems approximately subject to certain inexact criteria are truly implementable. In this paper, we first propose an inexact p...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of optimization theory and applications Jg. 154; H. 2; S. 536 - 548
Hauptverfasser:	He, Bingsheng, Yuan, Xiaoming
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.08.2012 Springer Nature B.V
Schlagworte:	Acceleration Accuracy Algorithms Applications of Mathematics Calculus of Variations and Optimal Control; Optimization Engineering Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Studies Theory of Computation Convex minimization Inexact Proximal point algorithm Acceleration
ISSN:	0022-3239, 1573-2878
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!