Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming (Q4609466)

scientific article; zbMATH DE number 6855325

Language	Label	Description	Also known as
English	Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming	scientific article; zbMATH DE number 6855325

Statements

instance of

scholarly article

0 references

title

Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming (English)

0 references

published in

SIAM Journal on Optimization

0 references

publication date

3 April 2018

0 references

full work available at URL

https://arxiv.org/abs/1608.03928

0 references

zbMATH Keywords

block coordinate update (BCU)

0 references

Jacobian rule

0 references

Gauss-Seidel rule

0 references

alternating direction method of multipliers (ADMM)

0 references

author

Yang-yang Xu

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Q4821526

0 references

Robust principal component analysis?

0 references

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

0 references

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

0 references

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

0 references

Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping

0 references

A three-operator splitting scheme and its optimization applications

0 references

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

0 references

Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem

0 references

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

0 references

Randomized primal-dual proximal block coordinate updates

0 references

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

0 references

Q4144736

0 references

A note on the alternating direction method of multipliers

0 references

On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming

0 references

Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming

0 references

Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming

0 references

On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM

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

Iteration complexity analysis of block coordinate descent methods

0 references

Q4040931

0 references

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

0 references

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

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

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

0 references

A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints

0 references

Q5491447

0 references

Coordinate-friendly structures, algorithms and applications

0 references

ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates

0 references

A Class of Randomized Primal-Dual Algorithms for Distributed Optimization

0 references

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

0 references

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

0 references

Q4864293

0 references

SDPT3 — A Matlab software package for semidefinite programming, Version 1.3

0 references

Convergence of a block coordinate descent method for nondifferentiable minimization

0 references

Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

Minimizing Certain Convex Functions

0 references

Compressive principal component pursuit

0 references

Coordinate descent algorithms

0 references

Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming

0 references

Proximal gradient method for huberized support vector machine

0 references

A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion

0 references

A globally convergent algorithm for nonconvex optimization based on block coordinate update

0 references

Identifiers

zbMATH Open document ID

1384.90072

0 references

DOI

10.1137/16M1084705

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4609466