An interior point Newton-like method for non-negative least-squares problems with degenerate solution

Numerical Linear Algebra with Applications

Volumn 13, Issue 10, 2006, Pages 825-846

  Bellavia, Stefania ^a   Macconi, Maria ^a   Morini, Benedetta ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Convex quadratic programming; Degeneracy; Global convergence; Inexact Newton methods; Interior point methods

Indexed keywords

EID: 33845602080     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/nla.502     Document Type: Article

References (34)

1. Björck A. Numerical Methods for Least Squares Problems. SIAM: Philadelphia, PA, 1996.
2. Lotstedt P. Perturbation bounds for the linear least-squares problem subject to linear inequality constraints. BIT 1983; 23:500-519.
3. Gill PE, Murray W, Wright MH. Practical Optimization. Academic Press: New York, 1981.
4. Lawson CL, Hanson RJ. Solving Least-Squares Problems. Prentice-Hall: Englewood Cliffs, NJ, 1974.
5. Bierlaire M, Toint PhL, Tuyttens D. On iterative algorithms for linear least-squares problems with bound constraints. Linear Algebra and its Applications 1991; 143:111-143.
6. Lin CJ, Moré JJ. Newton's method for large bound-constrained optimization problems. SIAM Journal on Optimization 1999; 9:1100-1127.
7. Moré JJ, Toraldo G. On the solution of large quadratic programming problems with bound constraints. SIAM Journal on Optimization 1991; 1:93-113.
8. Morigi S, Reichel L, Sgallari F, Zama F. An iterative method for linear discrete ill-posed problems with box constraints. Journal of Computational and Applied Mathematics, in press.
9. Portugal LF, Judice JJ, Vicente LN. A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variables. Mathematics of Computation 1994; 63:625-643.
10. Chen SS, Donoho DL, Saunders MA. Atomic decomposition by basis pursuit. SIAM Review 2001; 43:129-159.
11. Calvetti D, Landi G, Reichel L, Sgallari F. Non-negativity and iterative methods for ill-posed problems. Inverse Problems 2004; 20:1747-1758.
12. Hanke M, Nagy JG, Vogel C. Quasi-Newton approach to nonnegative image restoration. Linear Algebra and Its Applications 2000; 316:223-236.
13. Kim B. Numerical optimization methods for image restoration. Ph.D. Thesis, Stanford University, 2002.
14. Rojas M, Steihaug T. An interior point trust-region based method for large non-negativity regularization. Inverse Problems 2002; 18:1291-1307.
15. Coleman TF, Li Y. An interior trust-region approach for nonlinear minimization subject to bounds. SIAM Journal on Optimization 1996; 6:418-445.
16. Coleman TF, Li Y. A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables. SIAM Journal on Optimization 1996; 6:1040-1058.
17. Dennis JE, Vicente LN. Trust-region interior-point algorithms for minimization problems with simple bounds. In Applied Mathematics and Parallel Computing, Fischer et al. (eds). Festscrift for Klaus Ritter, Physica, Heidelberg, 1996; 97-107.
18. Griva I, Shanno DF, Vanderbei RJ. Convergence analysis of a primal-dual interior point method for nonlinear programming. Optimization Online, http://www.optimizationonline.org/DBHTML/2004
19. Heinkenschloss M, Ulbrich M, Ulbrich S. Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumptions. Mathematical Programming 1999; 86:615-635.
20. Kanzow K, Klug A. On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints. Computational Optimization and Applications, in press.
21. Ulbrich M. Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems. SIAM Journal on Optimization 2000; 11:889-917.
22. Coleman TF, Hulbert LA. A globally and superlinearly convergent algorithm for convex quadratic programs with simple bounds. SIAM Journal on Optimization 1993; 3:298-321.
23. Coleman TF, Liu J. An exterior Newton method for strictly convex quadratic programming. Computational Optimization and Applications 2000; 15:5-32.
24. Vanderbei RJ. LOQO: an interior point code for quadratic programming. Technical Report SOR 94-15, Princeton University, 1994.
25. Wright SJ. Primal-Dual Interior-Point Methods. SIAM: Philadelphia, PA, 1997.
26. Dembo RS, Eisenstat SC, Steihaug T. Inexact Newton methods. SIAM Journal on Numerical Analysis 1982; 19:400-408.
27. Freund R, Nachtigal N. QMR: A quasi-minimal residual method for non-Hermitian linear systems. Numerische Mathematik 1991; 60:315-339.
28. Fletcher R. Conjugate gradient methods for indefinite systems. In Numerical Analysis Dundee, Watson G (ed.), vol. 1975. Springer: Berlin, 1976; 73-89.
29. Lanczos C. Solution of linear equations by minimized iterations. Journal of Research of the National Bureau of Standards 1952; 49:33-53.
30. Van der Vorst HA. Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonlinear systems. SIAM Journal on Statistical and Scientific Computing 1992; 13:631-644.
31. Saad Y, Schultz MH. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Statistical and Scientific Computing 1986; 7:856-869.
32. Paige CC, Saunders MA. LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Transactions on Mathematical Software 1982; 8:43-71.
33. Duff I, Grimes R, Lewis J. Sparse matrix test problems. ACM Transactions on Mathematical Software 1989; 15:1-14.
34. Nocedal J, Sartenear A, Zhu C. On the behaviour of the gradient norm in the steepest descent method. Computational Optimization and Applications 2002; 22:5-35.