Generalizations of the proximal method of multipliers in convex optimization
From MaRDI portal
Publication:6179878
DOI10.1007/s10589-023-00519-7OpenAlexW4386292116MaRDI QIDQ6179878
Publication date: 18 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-00519-7
stopping criteriaaugmented Lagrangian methodsprogressive decouplinglinear convergence guaranteesmuliplier methodsvariable-metric prox terms
Cites Work
- Partial inverse of a monotone operator
- Perturbed augmented Lagrangian method framework with applications to proximal and smoothed variants
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- Multiplier and gradient methods
- Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- A Class of Inexact Variable Metric Proximal Point Algorithms
- Applications of the method of partial inverses to convex programming: Decomposition
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Implicit Functions and Solution Mappings
- Convex Analysis
- Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming
- Unnamed Item
- Unnamed Item
