Interior-Point Gradient Method for Large-Scale Totally Nonnegative Least Squares Problems

By Michael Merritt, Yin Zhang. 2005

74 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent (2011, methodology): “Note that the FGD for FMD-NMF will degenerate to the interior-point gradient (IPG) method [32] for nonnegative least squares problems if setting .”
Nonnegative Matrix Factorization: A Comprehensive Review (2013, methodology): “Linear Projection-Based NMF (LPBNMF) suggested by Li and Zhang [69], where VV ¼ QQX and XX (cid:5) UUQX , can be regarded as the dual problem of Convex NMF.”
Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework (2013, methodology): “Merritt and Zhang [73] proposed an interior point gradient method, and Friedlander and Hatz [32] used a two-metric projected gradient method in their study on NTF.”