Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (Q1734768): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 06:38, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs	scientific article

Statements

scholarly article

0 references

Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (English)

0 references

Computational Optimization and Applications

0 references

publication date

27 March 2019

0 references

full work available at URL

https://arxiv.org/abs/1705.06391

0 references

zbMATH Keywords

asynchronous parallel

0 references

block coordinate update

0 references

primal-dual method

0 references

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization

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

Asynchronous Distributed ADMM for Large-Scale Optimization—Part I: Algorithm and<?Pub _newline ?>Convergence Analysis

0 references

Asynchronous Distributed ADMM for Large-Scale Optimization—Part II: Linear Convergence Analysis and Numerical Performance

0 references

Chaotic relaxation

0 references

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

0 references

Atomic Decomposition by Basis Pursuit

0 references

Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions

0 references

Support-vector networks

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

Randomized primal-dual proximal block coordinate updates

0 references

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

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

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

Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising

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

Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties

0 references

An Asynchronous Parallel Stochastic Coordinate Descent Algorithm

0 references

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

0 references

Coordinate-friendly structures, algorithms and applications

0 references

ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates

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

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

0 references

On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm

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

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

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

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S10589-018-0037-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1734768

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1734768&oldid=38719642"