A dual-primal balanced augmented Lagrangian method for linearly constrained convex programming
From MaRDI portal
Publication:2700144
DOI10.1007/s12190-022-01779-yOpenAlexW4206849380WikidataQ114221164 ScholiaQ114221164MaRDI QIDQ2700144
Publication date: 20 April 2023
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.02106
variational inequalityconvex programmingaugmented Lagrangian methodproximal point algorithmdual-primal
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Latent variable graphical model selection via convex optimization
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- A first-order primal-dual algorithm for convex problems with applications to imaging
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
- Multiplier and gradient methods
- Exact matrix completion via convex optimization
- Atomic Decomposition by Basis Pursuit
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
- Lagrange Multiplier Approach to Variational Problems and Applications
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- First-Order Methods in Optimization
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Efficient and Convergent Preconditioned ADMM for the Potts Models
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
- Practical Augmented Lagrangian Methods for Constrained Optimization
