Preconditioned proximal point methods and notions of partial subregularity
From MaRDI portal
Publication:5144479
zbMath1455.49012arXiv1711.05123MaRDI QIDQ5144479
Publication date: 18 January 2021
Full work available at URL: https://arxiv.org/abs/1711.05123
Numerical methods involving duality (49M29) Numerical methods based on necessary conditions (49M05) Monotone operators and generalizations (47H05) Set-valued and variational analysis (49J53) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
On the linear convergence of the general first order primal-dual algorithm, Acceleration and Global Convergence of a First-Order Primal-Dual Method for Nonconvex Problems, Predictive online optimisation with applications to optical flow, Regularisation, optimisation, subregularity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs
- Stability of saddle points via explicit coderivatives of pointwise subdifferentials
- A Lyusternik-Graves theorem for the proximal point method
- Metric subregularity and the proximal point method
- A unified approach to error bounds for structured convex optimization problems
- Acceleration of the PDHGM on partially strongly convex functions
- On the variational principle
- Regularity and conditioning of solution mappings in variational analysis
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Testing and non-linear preconditioning of the proximal point method
- Block-proximal methods with spatially adapted acceleration
- Strong metric subregularity of mappings in variational analysis and optimization
- Slopes of multifunctions and extensions of metric regularity
- Local Monotonicity and Full Stability for Parametric Variational Systems
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- Newton's Method for Solving Inclusions Using Set-Valued Approximations
- On calmness conditions in convex bilevel programming
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Coderivative characterizations of maximal monotonicity for set-valued mappings
- Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
- First Order and Second Order Characterizations of Metric Subregularity and Calmness of Constraint Set Mappings
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Directional Metric Regularity of Multifunctions
- Error Bounds in Metric Spaces and Application to the Perturbation Stability of Metric Regularity
- Regular Points of Lipschitz Functions
- Some continuity properties of polyhedral multifunctions
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Monotone Operators and the Proximal Point Algorithm
- Variational Analysis
- Optimality conditions for bilevel programming problems
- Hölder Metric Subregularity with Applications to Proximal Point Method
- Variational Analysis of Regular Mappings
- Error bounds and metric subregularity
- A New Type of Directional Regularity for Mappings and Applications to Optimization
- Partial Smoothness, Tilt Stability, and Generalized Hessians
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Metric subregularity of the convex subdifferential in Banach spaces
- Implicit Functions and Solution Mappings
- Robinson Stability of Parametric Constraint Systems via Variational Analysis
- Set-valued analysis
