Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity

DOI10.1137/22m152147xzbMath1530.47080MaRDI QIDQ6176421

No author found.

Publication date: 23 August 2023

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

convergence rateHölder metric subregularityinexact proximal point algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Monotone operators and generalizations (47H05) Set-valued and variational analysis (49J53) Iterative procedures involving nonlinear operators (47J25) Variational and other types of inclusions (47J22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite termination of inexact proximal point algorithms in Hilbert spaces
• Enhanced metric regularity and Lipschitzian properties of variational systems
• Metric subregularity of order \(q\) and the solving of inclusions
• New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
• Higher-order metric subregularity and its applications
• On metric and calmness qualification conditions in subdifferential calculus
• Metric subregularity and the proximal point method
• Monotone (nonlinear) operators in Hilbert space
• Weak convergence theorems for nonexpansive mappings in Banach spaces
• Finite termination of the proximal point algorithm
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Error bounds for analytic systems and their applications
• Regularity and conditioning of solution mappings in variational analysis
• Forcing strong convergence of proximal point iterations in a Hilbert space
• Convergence analysis of inexact proximal point algorithms on Hadamard manifolds
• Hölder-type global error bounds for non-degenerate polynomial systems
• Techniques of variational analysis
• Problèmes de minimax via l'analyse convexe et les inégalités variationelles: Théorie et algorithmes
• Weak sharp minima revisited. II: Application to linear regularity and error bounds
• Calmness of constraint systems with applications
• On the monotonicity of the gradient of a convex function
• Metric regularity and Lipschitzian stability of parametric variational systems
• A globally convergent proximal Newton-type method in nonsmooth convex optimization
• On calmness conditions in convex bilevel programming
• On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
• Weak Sharp Minima in Mathematical Programming
• First Order and Second Order Characterizations of Metric Subregularity and Calmness of Constraint Set Mappings
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
• Implicit Functions and Solution Mappings
• New Proximal Point Algorithms for Convex Minimization
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Extension of Hoffman’s Error Bound to Polynomial Systems
• Construction of best Bregman approximations in reflexive Banach spaces
• Global error bounds for convex quadratic inequality systems^*
• Hölder Metric Subregularity with Applications to Proximal Point Method
• Weak Sharp Minima: Characterizations and Sufficient Conditions
• Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
• A Unified Augmented Lagrangian Approach to Duality and Exact Penalization

This page was built for publication: Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity