An accelerated inexact proximal point algorithm for convex minimization

DOI10.1007/s10957-011-9948-6zbMath1256.90033OpenAlexW2079491734MaRDI QIDQ1937079

Xiao-Ming Yuan, Bing-sheng He

Publication date: 11 February 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-011-9948-6

zbMATH Keywords

inexactaccelerationconvex minimizationproximal point algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

The developments of proximal point algorithms ⋮ Inexact first-order primal-dual algorithms ⋮ Inexact accelerated augmented Lagrangian methods ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ Accelerated differential inclusion for convex optimization ⋮ Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems ⋮ Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice ⋮ Convergence analysis of an inexact three-operator splitting algorithm ⋮ The indefinite proximal point algorithms for maximal monotone operators ⋮ An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints

Cites Work

• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Approximate iterations in Bregman-function-based proximal algorithms
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• New Proximal Point Algorithms for Convex Minimization
• Monotone Operators and the Proximal Point Algorithm
• A Variable Metric Proximal Point Algorithm for Monotone Operators
• Proximité et dualité dans un espace hilbertien