Efficient nonnegative matrix factorization by DC programming and DCA
DOI10.1162/NECO_A_00836zbMATH Open1472.65070OpenAlexW2347000901WikidataQ39802817 ScholiaQ39802817MaRDI QIDQ5380443FDOQ5380443
Authors: Le Thi Hoai An, Pham Dinh Tao, X. T. Vo
Publication date: 4 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_00836
Recommendations
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Efficient nonnegative matrix factorization via projected Newton method
- Alternative gradient algorithms with applications to nonnegative matrix factorizations
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Learning sparse representations by non-negative matrix factorization and sequential cone programming
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Factorization of matrices (15A23) Analysis of algorithms (68W40) Nonconvex programming, global optimization (90C26)
Cites Work
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The ubiquitous Kronecker product
- Algorithms and applications for approximate nonnegative matrix factorization
- On the complexity of nonnegative matrix factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Non-negative matrix factorization with sparseness constraints
- Learning the parts of objects by non-negative matrix factorization
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Fast nonnegative matrix factorization: an active-set-like method and comparisons
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- A new efficient algorithm based on DC programming and DCA for clustering
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Binary classification via spherical separator by DC programming and DCA
- A DC programming approach for feature selection in support vector machines learning
- Optimization based DC programming and DCA for hierarchical clustering
- DC approximation approaches for sparse optimization
- Block clustering based on difference of convex functions (DC) programming and DC algorithms
- Self-organizing maps by difference of convex functions optimization
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
- Document clustering using nonnegative matrix factorization
- Nonnegative matrix factorization for spectral data analysis
- Descriptive matrix factorization for sustainability. Adopting the principle of opposites
- Efficient nonnegative matrix factorization via projected Newton method
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
- A DC Programming Approach for Finding Communities in Networks
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
Cited In (11)
- Analysis sparse representation for nonnegative signals based on determinant measure by DC programming
- DC programming and DCA: thirty years of developments
- Conic optimization-based algorithms for nonnegative matrix factorization
- Learning sparse representations by non-negative matrix factorization and sequential cone programming
- LibNMF -- a library for nonnegative matrix factorization
- Nested nonnegative cone analysis
- DCA for Gaussian kernel support vector machines with feature selection
- Open issues and recent advances in DC programming and DCA
- DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling
- Alternating DC algorithm for partial DC programming problems
- Alternative quadratic programming for non-negative matrix low-order factorization
Uses Software
This page was built for publication: Efficient nonnegative matrix factorization by DC programming and DCA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380443)