Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm
From MaRDI portal
Publication:6188057
DOI10.1007/s10589-023-00494-zOpenAlexW4378192446MaRDI QIDQ6188057
Publication date: 10 January 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-023-00494-z
convex optimizationproximal point algorithmmaximal monotone mappingsmetric subregularitylinear convergence guaranteeslocalized executabilityvariable-metric implementation
Related Items (1)
Cites Work
- Partial inverse of a monotone operator
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- Variational convexity and the local monotonicity of subgradient mappings
- Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- A Class of Inexact Variable Metric Proximal Point Algorithms
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- A Variable Metric Proximal Point Algorithm for Monotone Operators
- Variational Analysis
- Implicit Functions and Solution Mappings
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming
- Unnamed Item
This page was built for publication: Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm
