Convergence of a proximal point algorithm for solving minimization problems
From MaRDI portal
Summary: We introduce and consider a proximal point algorithm for solving minimization problems using the technique of Güler. This proximal point algorithm is obtained by substituting the usual quadratic proximal term by a class of convex nonquadratic distance-like functions. It can be seen as an extragradient iterative scheme. We prove the convergence rate of this new proximal point method under mild assumptions. Furthermore, it is shown that this estimate rate is better than the available ones.
Recommendations
Cites work
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convex Analysis
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Entropy-Like Proximal Methods in Convex Programming
- Finite termination of the proximal point algorithm
- scientific article; zbMATH DE number 4079168 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 776083 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Iterative algorithms for general multivalued variational inequalities
- New Proximal Point Algorithms for Convex Minimization
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Proximal minimization algorithm with \(D\)-functions
- Proximal Minimization Methods with Generalized Bregman Functions
- Proximité et dualité dans un espace hilbertien
- Some developments in general variational inequalities
- Some iterative methods for solving nonconvex bifunction equilibrium variational inequalities
Cited in
(16)- A proximal point algorithm for minimax problems
- Convergence results of two-step inertial proximal point algorithm
- The projected polar proximal point algorithm converges globally
- Theoretical aspect of diagonal Bregman proximal methods
- Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems
- scientific article; zbMATH DE number 3930256 (Why is no real title available?)
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- New Proximal Point Algorithms for Convex Minimization
- Convergence of generalized contraction-proximal point algorithms for solving unconstrained convex optimization problems
- On the convergence of the proximal algorithm for saddle-point problems
- On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem
- scientific article; zbMATH DE number 5586189 (Why is no real title available?)
- An inexact Halpern-type proximal point algorithm for nuclear norm minimization
- scientific article; zbMATH DE number 7483223 (Why is no real title available?)
- Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm
- On the convergence rate of the proximal point algorithm in Hilbert spaces
This page was built for publication: Convergence of a proximal point algorithm for solving minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442796)
