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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of optimization theory and applications Vol. 154; no. 2; pp. 536 - 548
Main Authors:	He, Bingsheng, Yuan, Xiaoming
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.08.2012 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!