Inexact coordinate descent: complexity and preconditioning (Q306308): Difference between revisions

The paper is concerned with coordinate descent methods in which a randomized choice of the descent index is combined with an inexact construction of the updates. Numerical experiments are also provided.

0 references

reviewed by

Constantin Popa

0 references

zbMATH Keywords

inexact methods

0 references

block coordinate descent

0 references

convex optimization

0 references

iteration complexity

0 references

preconditioning

0 references

conjugate gradients

0 references

numerical experiments

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Methods of conjugate gradients for solving linear systems

0 references

Compressed sensing

0 references

Sparse Reconstruction by Separable Approximation

0 references

Efficient block-coordinate descent algorithms for the group Lasso

0 references

Standardization and the Group Lasso Penalty

0 references

Exact matrix completion via convex optimization

0 references

Parallel stochastic gradient algorithms for large-scale matrix completion

0 references

Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

Accelerated Block-coordinate Relaxation for Regularized Optimization

0 references

Gradient methods for minimizing composite functions

0 references

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

0 references

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

0 references

Paved with good intentions: analysis of a randomized block Kaczmarz method

0 references

Randomized Methods for Linear Constraints: Convergence Rates and Conditioning

0 references

A randomized Kaczmarz algorithm with exponential convergence

0 references

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

0 references

Parallel coordinate descent methods for big data optimization

0 references

Convergence of a block coordinate descent method for nondifferentiable minimization

0 references

On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods

0 references

Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization

0 references

First-order methods of smooth convex optimization with inexact oracle

0 references

Stochastic intermediate gradient method for convex problems with stochastic inexact oracle

0 references

Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition

0 references

The self regulation problem as an inexact steepest descent method for multicriteria optimization

0 references

Inexact block coordinate descent methods with application to non-negative matrix factorization

0 references

On the convergence of inexact block coordinate descent methods for constrained optimization

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Numerical solution of saddle point problems

0 references

Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration

0 references

On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides

0 references

Quadratic regularizations in an interior-point method for primal block-angular problems

0 references

Parallel interior-point solver for structured linear programs

0 references

An Interior Point Method for Block Angular Optimization

0 references

The university of Florida sparse matrix collection

0 references

A box constrained gradient projection algorithm for compressed sensing

0 references

Identifiers

zbMATH Open document ID

1350.65062

0 references

DOI

10.1007/s10957-016-0867-4

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:306308

@@ Property / describes a project that uses @@
+Jellyfish
@@ Property / describes a project that uses: Jellyfish / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+OOPS
@@ Property / describes a project that uses: OOPS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SparseMatrix
@@ Property / describes a project that uses: SparseMatrix / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1673797905
@@ Property / OpenAlex ID: W1673797905 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5530
@@ Property / arXiv ID: 1304.5530 / rank @@
+Normal rank
@@ Property / cites work @@
+Methods of conjugate gradients for solving linear systems
+Normal rank
@@ Property / cites work @@
+Compressed sensing
@@ Property / cites work: Compressed sensing / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse Reconstruction by Separable Approximation
@@ Property / cites work: Sparse Reconstruction by Separable Approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient block-coordinate descent algorithms for the group Lasso
+Normal rank
@@ Property / cites work @@
+Standardization and the Group Lasso Penalty
@@ Property / cites work: Standardization and the Group Lasso Penalty / rank @@
+Normal rank
@@ Property / cites work @@
+Exact matrix completion via convex optimization
@@ Property / cites work: Exact matrix completion via convex optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel stochastic gradient algorithms for large-scale matrix completion
+Normal rank
@@ Property / cites work @@
+Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design
+Normal rank
@@ Property / cites work @@
+A coordinate gradient descent method for nonsmooth separable minimization
+Normal rank
@@ Property / cites work @@
+Accelerated Block-coordinate Relaxation for Regularized Optimization
+Normal rank
@@ Property / cites work @@
+Gradient methods for minimizing composite functions
+Normal rank
@@ Property / cites work @@
+Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
+Normal rank
@@ Property / cites work @@
+Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
+Normal rank
@@ Property / cites work @@
+Paved with good intentions: analysis of a randomized block Kaczmarz method
+Normal rank
@@ Property / cites work @@
+Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
+Normal rank
@@ Property / cites work @@
+A randomized Kaczmarz algorithm with exponential convergence
+Normal rank
@@ Property / cites work @@
+A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
+Normal rank
@@ Property / cites work @@
+Parallel coordinate descent methods for big data optimization
+Normal rank
@@ Property / cites work @@
+Convergence of a block coordinate descent method for nondifferentiable minimization
+Normal rank
@@ Property / cites work @@
+On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods
+Normal rank
@@ Property / cites work @@
+Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
+Normal rank
@@ Property / cites work @@
+First-order methods of smooth convex optimization with inexact oracle
+Normal rank
@@ Property / cites work @@
+Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
+Normal rank
@@ Property / cites work @@
+Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition
+Normal rank
@@ Property / cites work @@
+The self regulation problem as an inexact steepest descent method for multicriteria optimization
+Normal rank
@@ Property / cites work @@
+Inexact block coordinate descent methods with application to non-negative matrix factorization
+Normal rank
@@ Property / cites work @@
+On the convergence of inexact block coordinate descent methods for constrained optimization
+Normal rank
@@ Property / cites work @@
+Introductory lectures on convex optimization. A basic course.
+Normal rank
@@ Property / cites work @@
+Numerical solution of saddle point problems
@@ Property / cites work: Numerical solution of saddle point problems / rank @@
+Normal rank
@@ Property / cites work @@
+Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
+Normal rank
@@ Property / cites work @@
+On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
+Normal rank
@@ Property / cites work @@
+Quadratic regularizations in an interior-point method for primal block-angular problems
+Normal rank
@@ Property / cites work @@
+Parallel interior-point solver for structured linear programs
+Normal rank
@@ Property / cites work @@
+An Interior Point Method for Block Angular Optimization
+Normal rank
@@ Property / cites work @@
+The university of Florida sparse matrix collection
+Normal rank
@@ Property / cites work @@
+A box constrained gradient projection algorithm for compressed sensing
+Normal rank