Metric subregularity and the proximal point method
From MaRDI portal
Abstract: We examine the linear convergence rates of variants of the proximal point method for finding zeros of maximal monotone operators. We begin by showing how metric subregularity is sufficient for linear convergence to a zero of a maximal monotone operator. This result is then generalized to obtain convergence rates for the problem of finding a common zero of multiple monotone operators by considering randomized and averaged proximal methods.
Recommendations
Cites work
- A limit theorem for projections
- About regularity of collections of sets
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Best approximation in inner product spaces
- Bounded linear regularity, strong CHIP, and CHIP are distinct properties
- Characterization of metric regularity of subdifferentials
- Convergence of the Proximal Point Method for Metrically Regular Mappings
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- Decomposition through formalization in a product space
- scientific article; zbMATH DE number 1009689 (Why is no real title available?)
- scientific article; zbMATH DE number 1369459 (Why is no real title available?)
- scientific article; zbMATH DE number 3016396 (Why is no real title available?)
- scientific article; zbMATH DE number 2190119 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Iterative selection methods for common fixed point problems
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- LYUSTERNIK'S THEOREM AND THE THEORY OF EXTREMA
- Metric inequality, subdifferential calculus and applications
- Metric regularity and subdifferential calculus
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- On metric and calmness qualification conditions in subdifferential calculus
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Randomized methods for linear constraints: convergence rates and conditioning
- Regularity and conditioning of solution mappings in variational analysis
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Some mapping theorems
- Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
- The barycentric proximal method.
- The radius of metric regularity
- Variational Analysis
Cited in
(34)- Implicit error bounds for Picard iterations on Hilbert spaces
- Solving composite fixed point problems with block updates
- Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry
- The developments of proximal point algorithms
- Augmented Lagrangian methods for convex matrix optimization problems
- An investigation on semismooth Newton based augmented Lagrangian method for image restoration
- Moduli of regularity and rates of convergence for Fejér monotone sequences
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- A unified and tight linear convergence analysis of the relaxed proximal point algorithm
- Convergence analysis of the generalized Douglas-Rachford splitting method under Hölder subregularity assumptions
- An efficient augmented Lagrangian method with semismooth Newton solver for total generalized variation
- Convergence rates with inexact non-expansive operators
- Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems
- A strong metric subregularity analysis of nonsmooth mappings via steepest displacement rate
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- scientific article; zbMATH DE number 1569001 (Why is no real title available?)
- Hölder metric subregularity with applications to proximal point method
- Discerning the linear convergence of ADMM for structured convex optimization through the lens of variational analysis
- Nonlinear metric subregularity
- Preconditioned proximal point methods and notions of partial subregularity
- Metric regularity of a positive order for generalized equations
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- The use of metric graphical regularity in approximate subdifferential calculus rules in finite dimensions
- Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity
- Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm
- Metric subregularity of order \(q\) and the solving of inclusions
- Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods
- Convergence of the preconditioned proximal point method and Douglas-Rachford splitting in the absence of monotonicity
- A Lyusternik-Graves theorem for the proximal point method
- On the growth of nonconvex functionals at strict local minimizers
- Anderson acceleration of the proximal point method: the exact adaptive minimax, a spectral phase transition, and optimal safeguarding
- Error bounds and Hölder metric subregularity
This page was built for publication: Metric subregularity and the proximal point method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034588)
