Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation (Q3379602)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation	scientific article

Statements

scholarly article

0 references

Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation (English)

0 references

Andersen Man Shun Ang

0 references

0 references

Neural Computation

0 references

publication date

27 September 2021

0 references

full work available at URL

https://arxiv.org/abs/1805.06604

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

On the Convergence of Block Coordinate Descent Type Methods

0 references

A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions

0 references

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

0 references

Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization

0 references

Accelerated, Parallel, and Proximal Coordinate Descent

0 references

Algorithms for Nonnegative Matrix Factorization with the β-Divergence

0 references

Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering

0 references

NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization

0 references

Iteration complexity analysis of block coordinate descent methods

0 references

Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework

0 references

Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method

0 references

Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons

0 references

Learning the parts of objects by non-negative matrix factorization

0 references

Projected Gradient Methods for Nonnegative Matrix Factorization

0 references

Linear and nonlinear programming.

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Adaptive restart for accelerated gradient schemes

0 references

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

0 references

On the Complexity of Nonnegative Matrix Factorization

0 references

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

0 references

Identifiers

zbMATH Open document ID

0 references

10.1162/neco_a_01157

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

DBLP publication ID

journals/neco/AngG19

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3379602

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