An interior point Newton‐like method for non‐negative least‐squares problems with degenerate solution
- 21 September 2006
- journal article
- research article
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 13 (10), 825-846
- https://doi.org/10.1002/nla.502
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Non-negativity and iterative methods for ill-posed problemsInverse Problems, 2004
- An interior-point trust-region-based method for large-scale non-negative regularizationInverse Problems, 2002
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumptionMathematical Programming, 1999
- A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative VariablesMathematics of Computation, 1994
- A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variablesMathematics of Computation, 1994
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- Perturbation bounds for the linear least squares problem subject to linear inequality constraintsBIT Numerical Mathematics, 1983
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least SquaresACM Transactions on Mathematical Software, 1982
- Conjugate gradient methods for indefinite systemsLecture Notes in Mathematics, 1976