Efficient Nonnegative Matrix Factorization by DC Programming and DCA (Q5380443)

scientific article; zbMATH DE number 7062557

Language	Label	Description	Also known as
English	Efficient Nonnegative Matrix Factorization by DC Programming and DCA	scientific article; zbMATH DE number 7062557

Statements

instance of

scholarly article

0 references

title

Efficient Nonnegative Matrix Factorization by DC Programming and DCA (English)

0 references

zbMATH Open document ID

0 references

0 references

0 references

0 references

0 references

0 references

4 June 2019

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

describes a project that uses

NeNMF

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Algorithms and applications for approximate nonnegative matrix factorization

0 references

Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization

0 references

Efficient nonnegative matrix factorization via projected Newton method

0 references

NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization

0 references

Q3093232

0 references

Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization

0 references

Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem

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

Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms

0 references

The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

0 references

A new efficient algorithm based on DC programming and DCA for clustering

0 references

A DC programming approach for feature selection in support vector machines learning

0 references

Optimization based DC programming and DCA for hierarchical clustering

0 references

New and efficient DCA based algorithms for minimum sum-of-squares clustering

0 references

Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm

0 references

Binary classification via spherical separator by DC programming and DCA

0 references

Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms

0 references

Self-organizing maps by difference of convex functions optimization

0 references

A DC Programming Approach for Finding Communities in Networks

0 references

DC approximation approaches for sparse optimization

0 references

Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms

0 references

Learning the parts of objects by non-negative matrix factorization

0 references

Projected Gradient Methods for Nonnegative Matrix Factorization

0 references

A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)

0 references

Nonnegative matrix factorization for spectral data analysis

0 references

Convex analysis approach to d. c. programming: Theory, algorithms and applications

0 references

A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem

0 references

Document clustering using nonnegative matrix factorization

0 references

Descriptive matrix factorization for sustainability. Adopting the principle of opposites

0 references

The ubiquitous Kronecker product

0 references

On the Complexity of Nonnegative Matrix Factorization

0 references

full work available at URL

https://doi.org/10.1162/neco_a_00836

0 references

OpenAlex ID

W2347000901

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5380443