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

DOI10.1093/imanum/drq024zbMath1235.65061MaRDI QIDQ3096358

Silvia Bonettini

Publication date: 8 November 2011

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/drq024

zbMATH Keywords

convergence; constrained optimization; image recognition; numerical experimentation; large-scale problems; non-negative matrix factorization; gradient projection methods; nonlinear Gauss-Seidel method; alternating algorithms

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C06: Large-scale problems in mathematical programming

90C30: Nonlinear programming

94A08: Image processing (compression, reconstruction, etc.) in information and communication theory

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

A Scaled Gradient Projection Method for Bayesian Learning in Dynamical Systems, On the application of the spectral projected gradient method in image segmentation, Inexact coordinate descent: complexity and preconditioning, Quadratic scalarization for decomposed multiobjective optimization, Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization, Multiple graph regularized nonnegative matrix factorization, On the convergence of inexact block coordinate descent methods for constrained optimization, Starlet Transform in Astronomical Data Processing, Computing locally injective mappings by advanced MIPS

Uses Software

• TRON