A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
From MaRDI portal
Publication:3387904
DOI10.1287/moor.2019.1010zbMath1456.90124arXiv1401.7079MaRDI QIDQ3387904
Meisam Razaviyayn, Mingyi Hong, Tsung-Hui Chang, Zhi-Quan Luo, Shi-Qian Ma, Xiang-Feng Wang
Publication date: 8 January 2021
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.7079
alternating direction method of multipliers; randomized block coordinate descent; block successive upper-bound minimization
90C25: Convex programming
Related Items
Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming, On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming, Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version, A generic coordinate descent solver for non-smooth convex optimisation, Majorized iPADMM for Nonseparable Convex Minimization Models with Quadratic Coupling Terms, Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization, 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, Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications, On the sublinear convergence rate of multi-block ADMM, First-order algorithms for convex optimization with nonseparable objective and coupled constraints, Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights, Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs, A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming, Inertial alternating direction method of multipliers for non-convex non-smooth optimization, A proximal alternating direction method for multi-block coupled convex optimization, Randomized primal-dual proximal block coordinate updates, Alternating proximal gradient method for convex minimization
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
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Fast alternating linearization methods for minimizing the sum of two convex functions
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization
- On the linear convergence of the alternating direction method of multipliers
- Iteration complexity analysis of block coordinate descent methods
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- A unified primal-dual algorithm framework based on Bregman iteration
- A coordinate gradient descent method for nonsmooth separable minimization
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- 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
- Error bounds and convergence analysis of feasible descent methods: A general approach
- On the convergence of the coordinate descent method for convex differentiable minimization
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Coordinate descent algorithms
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Alternating proximal gradient method for convex minimization
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- Proximal Splitting Methods in Signal Processing
- 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
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
- An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Atomic Decomposition by Basis Pursuit
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- On the Convergence of Constrained Parallel Variable Distribution Algorithms
- Sparse Reconstruction by Separable Approximation
- MIMO Cognitive Radio: A Game Theoretical Approach
- Equilibrium Pricing of Interference in Cognitive Radio Networks
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
- A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Fast Alternating Direction Optimization Methods
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods
- On the Convergence of Block Coordinate Descent Type Methods
- 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
- 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
