Projected Gradient Methods for Nonnegative Matrix Factorization (Q5441321): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 15: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
Projected Gradient Methods for Nonnegative Matrix Factorization (English)
0 references
11 February 2008
0 references