First-order algorithms for convex optimization with nonseparable objective and coupled constraints
From MaRDI portal
Publication:1706676
DOI10.1007/s40305-016-0131-5zbMath1390.90423OpenAlexW2420341751MaRDI QIDQ1706676
Publication date: 28 March 2018
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-016-0131-5
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Decomposition methods (49M27)
Related Items
A parallel Gauss-Seidel method for convex problems with separable structure, On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming, On lower iteration complexity bounds for the convex concave saddle point problems, Majorized iPADMM for Nonseparable Convex Minimization Models with Quadratic Coupling Terms, Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems, Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization, Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming, Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights, Unnamed Item, Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems, An adaptive primal-dual framework for nonsmooth convex minimization, Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs, A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions, Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization, A proximal alternating direction method for multi-block coupled convex optimization, Randomized primal-dual proximal block coordinate updates
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- 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
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the information-adaptive variants of the ADMM: an iteration complexity perspective
- A flexible ADMM algorithm for big data applications
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
- On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
- Iterative Solution of Nonlinear Equations in Several Variables
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
