Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (Q1717220)

scientific article

Language	Label	Description	Also known as
English	Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights	scientific article

Statements

instance of

scholarly article

0 references

title

Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (English)

0 references

zbMATH Open document ID

1415.90079

0 references

DOI

10.1007/s10107-017-1205-9

0 references

0 references

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

7 February 2019

0 references

full work available at URL

https://arxiv.org/abs/1508.00193

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

nonseparable convex minimization

0 references

alternating direction method of multipliers

0 references

block coordinate descent method

0 references

iterate convergence

0 references

random permutation

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes

0 references

On the Convergence of Block Coordinate Descent Type Methods

0 references

Q3151174

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function

0 references

The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

0 references

On the convergence analysis of the alternating direction method of multipliers with three blocks

0 references

A note on the convergence of ADMM for linearly constrained convex optimization problems

0 references

An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming

0 references

On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions

0 references

Parallel multi-block ADMM with $o(1/k)$ convergence

0 references

On the global and linear convergence of the generalized alternating direction method of multipliers

0 references

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

0 references

A dual algorithm for the solution of nonlinear variational problems via finite element approximation

0 references

First-order algorithms for convex optimization with nonseparable objective and coupled constraints

0 references

Q3321366

0 references

Q4144736

0 references

A note on the alternating direction method of multipliers

0 references

An ADM-based splitting method for separable convex programming

0 references

A splitting method for separable convex programming

0 references

Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming

0 references

On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method

0 references

A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization

0 references

On the linear convergence of the alternating direction method of multipliers

0 references

Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems

0 references

Iteration complexity analysis of block coordinate descent methods

0 references

A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block

0 references

A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization

0 references

A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions

0 references

Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity

0 references

On the Global Linear Convergence of the ADMM with MultiBlock Variables

0 references

On the sublinear convergence rate of multi-block ADMM

0 references

On the complexity analysis of randomized block-coordinate descent methods

0 references

Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers

0 references

Distributed Optimization With Local Domains: Applications in MPC and Network Flows

0 references

A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization

0 references

Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function

0 references

Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization

0 references

On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems

0 references

A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints

0 references

Convergence of a block coordinate descent method for nondifferentiable minimization

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

Coordinate descent algorithms

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1717220