Interior-point gradient method for large-scale totally nonnegative least squares problems

DOI10.1007/S10957-005-2668-ZMaRDI QIDQ813389zbMATH OpenOpenAlexFDO

Authors Michael Merritt, Yin Zhang

Publication date 8 February 2006

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1911/102020

zbMATH Keywords

interior-point gradient methodsTotally nonnegative least-squares problems

Mathematics Subject Classification ID

Quadratic programming (90C20) Interior-point methods (90C51)

Recommendations

• An interior point Newton-like method for non-negative least-squares problems with degenerate solution
• Computational experience with numerical methods for nonnegative least-squares problems.
• An interior-point trust-region-based method for large-scale non-negative regularization
• Gradient methods and conic least-squares problems

Cites work

• Convex programming in Hilbert space

Cited in

(12)

• Dose-volume-based IMRT fluence optimization: a fast least-squares approach with differentia\-bility
• A scaled gradient projection method for Bayesian learning in dynamical systems
• An adaptive accelerated first-order method for convex optimization
• An interior point Newton-like method for non-negative least-squares problems with degenerate solution
• An alternating projected gradient algorithm for nonnegative matrix factorization
• Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
• Bi-level algorithm for optimizing hyperparameters in penalized nonnegative matrix factorization
• Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks.
• Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
• An Alternating Rank-k Nonnegative Least Squares Framework (ARkNLS) for Nonnegative Matrix Factorization
• Alternative gradient algorithms with applications to nonnegative matrix factorizations
• Descent methods for nonnegative matrix factorization

This page was built for publication: Interior-point gradient method for large-scale totally nonnegative least squares problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813389)