Computational experience with numerical methods for nonnegative least-squares problems
DOI10.1002/nla.732zbMath1249.65080OpenAlexW2060778176MaRDI QIDQ2889392
Benedetta Morini, Jacek Gondzio, Stefania Bellavia
Publication date: 7 June 2012
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/10364076/Computational_Experience_with_Numerical_Methods_For_Nonnegative_Least_Squares_Problems.pdf
numerical resultspreconditioninginexact Newton methodaffine-scaling methodsbound-constrained least-squares problemcyclic Barzilai-Borwein strategy
Programming involving graphs or networks (90C35) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Preconditioners for iterative methods (65F08)
Related Items
Uses Software
Cites Work
- An affine-scaling interior-point CBB method for box-constrained optimization
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- Using constraint preconditioners with regularized saddle-point problems
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- A New Active Set Algorithm for Box Constrained Optimization
- An interior point Newton-like method for non-negative least-squares problems with degenerate solution
- Two-Point Step Size Gradient Methods
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Trust Region Methods
- A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Computing non-negative tensor factorizations
