Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
From MaRDI portal
Publication:1717220
DOI10.1007/s10107-017-1205-9zbMath1415.90079arXiv1508.00193OpenAlexW2963346039MaRDI QIDQ1717220
Yinyu Ye, Caihua Chen, Xin Liu, Min Li
Publication date: 7 February 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.00193
random permutationblock coordinate descent methodalternating direction method of multipliersiterate convergencenonseparable convex minimization
Related Items
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization, A Symmetric Inertial Alternating Direction Method of Multipliers for Elliptic Equation Constrained Optimization Problem, Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications, A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game, Majorized iPADMM for Nonseparable Convex Minimization Models with Quadratic Coupling Terms, A proximal fully parallel splitting method with a relaxation factor for separable convex programming, A linear algebra perspective on the random multi-block ADMM: the QP case, Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization, A Round Trip Time Weighting Model for One-way Delay Estimation, Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming, Unnamed Item, On Glowinski's open question on the alternating direction method of multipliers, Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms, An extended proximal ADMM algorithm for three-block nonconvex optimization problems, Unnamed Item, On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming, An inexact ADMM with proximal-indefinite term and larger stepsize
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- On the complexity analysis of randomized block-coordinate descent methods
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- A note on the convergence of ADMM for linearly constrained convex optimization problems
- On the linear convergence of the alternating direction method of multipliers
- Iteration complexity analysis of block coordinate descent methods
- On the sublinear convergence rate of multi-block ADMM
- A coordinate gradient descent method for nonsmooth separable minimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- First-order algorithms for convex optimization with nonseparable objective and coupled constraints
- A note on the alternating direction method of multipliers
- An ADM-based splitting method for separable convex programming
- On the convergence analysis of the alternating direction method of multipliers with three blocks
- Coordinate descent algorithms
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
- On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Distributed Optimization With Local Domains: Applications in MPC and Network Flows
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
- A splitting method for separable convex programming
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
- On the Convergence of Block Coordinate Descent Type Methods
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- Convergence of a block coordinate descent method for nondifferentiable minimization
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
