Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972): Difference between revisions

Latest revision as of 09:42, 30 July 2024

scientific article; zbMATH DE number 6937784

Language	Label	Description	Also known as
English	Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems	scientific article; zbMATH DE number 6937784

Statements

instance of

scholarly article

0 references

title

Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (English)

0 references

0 references

0 references

0 references

Analysis and Applications

0 references

publication date

17 September 2018

0 references

full work available at URL

https://arxiv.org/abs/1709.00982

0 references

zbMATH Keywords

large-scale optimization

0 references

randomized block-coordinate descent

0 references

linearly coupled constraints

0 references

convergence rate

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q3151174

0 references

A first-order primal-dual algorithm for convex problems with applications to imaging

0 references

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

0 references

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

0 references

Thresholded spectral algorithms for sparse approximations

0 references

On Full Jacobian Decomposition of the Augmented Lagrangian Method 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

Regularization schemes for minimum error entropy principle

0 references

On the complexity analysis of randomized block-coordinate descent methods

0 references

Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks

0 references

Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds

0 references

Random block coordinate descent methods for linearly constrained optimization over networks

0 references

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

0 references

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

0 references

Coordinate descent with arbitrary sampling I: algorithms and complexity<sup>†</sup>

0 references

Coordinate descent with arbitrary sampling II: expected separable overapproximation

0 references

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

0 references

On optimal probabilities in stochastic coordinate descent methods

0 references

Parallel coordinate descent methods for big data optimization

0 references

Q5396661

0 references

Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization

0 references

Optimal scaling of a gradient method for distributed resource allocation

0 references

Identifiers

zbMATH Open document ID

1395.68331

0 references

DOI

10.1142/S0219530518500082

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5375972

Revision as of 14:38, 16 July 2024 ReferenceBot (talk \| contribs) Bots 1,895,659 edits ‎Changed an Item ← Older edit	Latest revision as of 09:42, 30 July 2024 Openalex240730090724 (talk \| contribs) 579,206 edits Set OpenAlex properties.
	Property / OpenAlex ID
		W2963367716
	Property / OpenAlex ID: W2963367716 / rank
		Normal rank