A finite continuation algorithm for bound constrained quadratic programming

SIAM Journal on Optimization

Volumn 9, Issue 1, 1998, Pages 62-83

  Madsen, Kaj ^a   Nielsen, Hans Bruun ^a   Pinar, Mustafa Çelebi ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Bound constrained quadratic programming; Huber's M estimator; Lagrangian duality; Linear 1 estimation; Robust regression

Indexed keywords

EID: 0032237465     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495297820     Document Type: Article

References (16)

1. T. COLEMAN AND L. HULBERT, A globally and superlinearly convergent algorithm for quadratic programming with simple bounds, SIAM J. Optim., 3 (1993), pp. 298-321.
2. O. EDLUND, Private communication, Luleå University of Technology, Luleå, Sweden, 1997.
3. T factorizations, Math. Comp., 28 (1974), pp. 1067-1087.
4. W. M. GENTLEMAN, Least squares computation by Givens transformations without square roots, J. Inst. Math. Appl., 12 (1973), pp. 329-336.
5. P. E. GILL, S. J. HAMMARLING, W. MURRAY, M. A. SAUNDERS, AND M. H. WRIGHT, User's Guide for LSSOL ( Version 1.0): A Fortran Package for Constrained Linear Least Squares and Convex Quadratic Programming, Technical Report SOL 86-1, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA, 1986.
6. C.-G. HAN, P. PARDALOS, AND Y. YE, Computational aspects of an interior point algorithm for quadratic programming problems with box constraints, in Large-Scale Numerical Optimization, T. F. Coleman and Y. Li, eds., SIAM, Philadelphia, PA, 1990, pp. 92-112.
7. P. HUBER, Robust Statistics, John Wiley, New York, 1981.
8. W. LI AND J. SWETITS, A Newton method for convex regression, data smoothing, and quadratic programming with bounded constraints, SIAM J. Optim., 3 (1993), pp. 466-488.
9. W. LI AND J. SWETITS, A new algorithm for solving strictly convex quadratic programs, SIAM J. Optim., 7 (1997), pp. 595-619.
10. K. MADSEN AND H. B. NIELSEN, Finite algorithms for robust linear regression, BIT, 30 (1990), pp. 682-699.
11. K. MADSEN, H. B. NIELSEN, AND M.Ç. PINAR, A new finite continuation algorithm for linear programming, SIAM J. Optim., 6 (1996), pp. 600-616.
12. O. L. MANGASARIAN, Normal solution of linear programs, Math. Programming Stud., 22 (1984), pp. 206-216.
13. O. L. MANGASARIAN AND R. R. MEYER, Nonlinear perturbation of linear programs, SIAM J. Control Optim., 17 (1979), pp. 745-752.
14. J. MORE AND G. TORALDO, Algorithms for bound constrained quadratic programming problems, Numer. Math., 55 (1989), pp. 377-400.
15. x = c, Report NI-90-11, Institute of Mathematical Modelling, Numerical Analysis Group, Technical University of Denmark, DK-2800 Lyngby, Denmark, 1990.
16. 1 Estimation, Report NI-91-01, Institute of Mathematical Modelling, Numerical Analysis Group, Technical University of Denmark, DK-2800 Lyngby, Denmark, 1991.