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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of optimization theory and applications Ročník 154; číslo 2; s. 536 - 548
Hlavní autori:	He, Bingsheng, Yuan, Xiaoming
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.08.2012 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!