Learning sparse representations by non-negative matrix factorization and sequential cone programming

MaRDI QIDQ3093398zbMATH OpenFDO

Authors Matthias Heiler, Christoph Schnörr

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v7/heiler06a.html

zbMATH Keywords

sparsitynon-negative matrix factorizationsecond-order cone programmingreverse-convex programmingsequential convex optimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Convex programming (90C25) Computational methods for sparse matrices (65F50)

Recommendations

• Non-negative matrix factorization with sparseness constraints
• Sparse and unique nonnegative matrix factorization through data preprocessing
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• Efficient nonnegative matrix factorization by DC programming and DCA
• Nonnegative matrix factorization with constrained second-order optimization

Cited in

(19)

• Sparse mathematical morphology using non-negative matrix factorization
• Efficient nonnegative matrix factorization by DC programming and DCA
• Non-negative matrix factorization with sparseness constraints
• Efficient nonnegative matrix factorization via projected Newton method
• Nonnegative matrix factorization with band constraint
• Sparse low-rank separated representation models for learning from data
• Variational learning for rectified factor analysis
• Using underapproximations for sparse nonnegative matrix factorization
• Discovering Convolutive Speech Phones Using Sparseness and Non-negativity
• A discrete-time neurodynamic approach to sparsity-constrained nonnegative matrix factorization
• Learning layered ranking functions with structured support vector machines
• Sparse and unique nonnegative matrix factorization through data preprocessing
• Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
• SAGA: sparse and geometry-aware non-negative matrix factorization through non-linear local embedding
• Sparse canonical correlation analysis
• Feature re-factorization-based data sparse representation
• A novel framework for the NMF methods with experiments to unmixing signals and feature representation
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• A majorization-minimization based solution to penalized nonnegative matrix factorization with orthogonal regularization

Describes a project that uses

Uses Software

• Benchmarks for Optimization Software
• JAFFE
• SeDuMi

This page was built for publication: Learning sparse representations by non-negative matrix factorization and sequential cone programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093398)