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

DOI10.1093/imanum/drq024zbMath1235.65061OpenAlexW2014421268MaRDI 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

convergenceconstrained optimizationimage recognitionnumerical experimentationlarge-scale problemsnon-negative matrix factorizationgradient projection methodsnonlinear Gauss-Seidel methodalternating algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

On the application of the spectral projected gradient method in image segmentation ⋮ Neural blind deconvolution with Poisson data ⋮ Simultaneous reconstruction and segmentation with the Mumford-Shah functional for electron tomography ⋮ Inexact coordinate descent: complexity and preconditioning ⋮ A convergent least-squares regularized blind deconvolution approach ⋮ Quadratic scalarization for decomposed multiobjective optimization ⋮ Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization ⋮ A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems ⋮ Multiple graph regularized nonnegative matrix factorization ⋮ A dynamic scheduling process and methodology using route deviations and synchronized passenger transfers for flexible feeder transit services ⋮ Variable projection methods for separable nonlinear inverse problems with general-form Tikhonov regularization ⋮ Inexact penalty decomposition methods for optimization problems with geometric constraints ⋮ Random Coordinate Descent Methods for Nonseparable Composite Optimization ⋮ A study of progressive hedging for stochastic integer programming ⋮ Analysis of a variable metric block coordinate method under proximal errors ⋮ A cyclic block coordinate descent method with generalized gradient projections ⋮ Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization ⋮ Starlet Transform in Astronomical Data Processing ⋮ A block coordinate variable metric linesearch based proximal gradient method ⋮ Computing locally injective mappings by advanced MIPS ⋮ A unified convergence framework for nonmonotone inexact decomposition methods ⋮ A Scaled Gradient Projection Method for Bayesian Learning in Dynamical Systems ⋮ On the convergence of inexact block coordinate descent methods for constrained optimization

Uses Software

• TRON