A unified primal-dual algorithm framework for inequality constrained problems
From MaRDI portal
Publication:6057147
DOI10.1007/s10915-023-02346-8zbMath1522.90112arXiv2208.14196MaRDI QIDQ6057147
ZaiWen Wen, Junyu Zhang, Zhenyuan Zhu, Fan Chen
Publication date: 25 October 2023
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.14196
Convex programming (90C25) Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On the sublinear convergence rate of multi-block ADMM
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- A first-order primal-dual algorithm for convex problems with applications to imaging
- On the convergence analysis of the alternating direction method of multipliers with three blocks
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Randomized primal-dual proximal block coordinate updates
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Variational Analysis
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- A Semismooth Newton Method with Multidimensional Filter Globalization for $l_1$-Optimization
- A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems
- A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity
- Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- Convex analysis and monotone operator theory in Hilbert spaces
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Constrained composite optimization and augmented Lagrangian methods
- Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems
- Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints
