Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems
Summary: Proximal point algorithm is a type of method widely used in solving optimization problems and some practical problems such as machine learning in recent years. In this paper, a framework of accelerated proximal point algorithm is presented for convex minimization with linear constraints. The algorithm can be seen as an extension to Güler's methods for unconstrained optimization and linear programming problems. We prove that the sequence generated by the algorithm converges to a KKT solution of the original problem under appropriate conditions with the convergence rate of \(O\left( 1 / k^2\right)\).
- Inexact and accelerated proximal point algorithms
- On the linear convergence of a Bregman proximal point algorithm
- On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem
- Convergence of a proximal point algorithm for solving minimization problems
- A parameterized proximal point algorithm for separable convex optimization
- A general approach to convergence properties of some methods for nonsmooth convex optimization
- Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
- An accelerated augmented Lagrangian method for linearly constrained convex programming with the rate of convergence \(O\left({1/{k^2}} \right)\)
- Augmented Lagrangian algorithms for linear programming
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convex Analysis
- General parameterized proximal point algorithm with applications in statistical learning
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3359250 (Why is no real title available?)
- Message-passing for graph-structured linear programs: proximal methods and rounding schemes
- Monotone Operators and the Proximal Point Algorithm
- New Proximal Point Algorithms for Convex Minimization
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Relaxing Tight Frame Condition in Parallel Proximal Methods for Signal Restoration
- The rate of convergence of proximal method of multipliers for equality constrained optimization problems
- Variational Analysis
- A parameterized proximal point algorithm for separable convex optimization
- On convergence and complexity analysis of an accelerated forward-backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification
- A unified and tight linear convergence analysis of the relaxed proximal point algorithm
- Accelerating the convergence of the method of alternating projections via a line search: A brief survey
- Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
- Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
This page was built for publication: Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2214872)
