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

@@ Property / DOI @@
-.1162/neco.2007.19.10.2756
@@ Property / DOI: 10.1162/neco.2007.19.10.2756 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1162/neco.2007.19.10.2756
+Normal rank
@@ Property / OpenAlex ID @@
+W2110096996
@@ Property / OpenAlex ID: W2110096996 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Goldstein-Levitin-Polyak gradient projection method
+Normal rank
@@ Property / cites work @@
+Projected gradient methods for linearly constrained problems
+Normal rank
@@ Property / cites work @@
+On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
+Normal rank
@@ Property / cites work @@
+Learning the parts of objects by non-negative matrix factorization
+Normal rank
@@ Property / cites work @@
+Newton's Method for Large Bound-Constrained Optimization Problems
+Normal rank
@@ Property / cites work @@
+The Gradient Projection Method under Mild Differentiability Conditions
+Normal rank
@@ Property / cites work @@
+On search directions for minimization algorithms
@@ Property / cites work: On search directions for minimization algorithms / rank @@
+Normal rank
@@ Property / DOI @@
+.1162/NECO.2007.19.10.2756
@@ Property / DOI: 10.1162/NECO.2007.19.10.2756 / rank @@
+Normal rank