CoordinateWise Descent Methods for Leading Eigenvalue Problem (Q5230665)

scientific article; zbMATH DE number 7099357

Language	Label	Description	Also known as
English	CoordinateWise Descent Methods for Leading Eigenvalue Problem	scientific article; zbMATH DE number 7099357

Statements

instance of

scholarly article

0 references

title

CoordinateWise Descent Methods for Leading Eigenvalue Problem (English)

0 references

0 references

0 references

0 references

SIAM Journal on Scientific Computing

0 references

publication date

28 August 2019

0 references

full work available at URL

https://arxiv.org/abs/1806.05647

0 references

zbMATH Keywords

stochastic iterative method

0 references

coordinatewise descent method

0 references

leading eigenvalue problem

0 references

describes a project that uses

StingyCD

0 references

lobpcg.m

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A Coordinate-Descent Framework to Design Low PSL/ISL Sequences

0 references

Q4821526

0 references

Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications

0 references

The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices

0 references

Q4917542

0 references

Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions

0 references

Permuted Coordinate-Wise Optimizations Applied to Lp-Regularized Image Deconvolution

0 references

Iteration complexity analysis of block coordinate descent methods

0 references

Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method

0 references

First-order methods almost always avoid strict saddle points

0 references

An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization

0 references

Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties

0 references

An Asynchronous Parallel Stochastic Coordinate Descent Algorithm

0 references

An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations

0 references

Orbital minimization method with \(\ell^{1}\) regularization

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

0 references

Coordinate-friendly structures, algorithms and applications

0 references

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

0 references

Inexact Block Coordinate Descent Methods for Symmetric Nonnegative Matrix Factorization

0 references

A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems

0 references

On the complexity of parallel coordinate descent

0 references

Convergence of a block coordinate descent method for nondifferentiable minimization

0 references

Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization

0 references

A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix

0 references

Q4617641

0 references

Coordinate descent algorithms

0 references

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

0 references

Identifiers

zbMATH Open document ID

1420.65051

0 references

DOI

10.1137/18M1202505

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5230665