Projected Gradient Methods for Nonnegative Matrix Factorization (Q5441321): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1162/neco.2007.19.10.2756 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2110096996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Goldstein-Levitin-Polyak gradient projection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected gradient methods for linearly constrained problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning the parts of objects by non-negative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's Method for Large Bound-Constrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gradient Projection Method under Mild Differentiability Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On search directions for minimization algorithms / rank
 
Normal rank

Latest revision as of 16:36, 27 June 2024

scientific article; zbMATH DE number 5234430
Language Label Description Also known as
English
Projected Gradient Methods for Nonnegative Matrix Factorization
scientific article; zbMATH DE number 5234430

    Statements