Bound constrained quadratic programming via piecewise quadratic functions

Mathematical Programming, Series B

Volumn 85, Issue 1, 1999, Pages 135-156

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

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Bound constrained quadratic programming; Condition estimation Newton iteration factorization update; Huber's M estimator

Indexed keywords

EID: 0000042397     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050049     Document Type: Article

References (19)

1. Andersen, E.D., Gondzio, J., Mészáros, C., Xu, X. (1996): Implementation of interior point methods for large scale linear programming. In: Terlaky, T., Ed., Interior point methods in mathematical programming, pp. 189-252, Kluwer Academic Publishers, Dordrecht
2. T. Coleman, Hulbert, L. (1993): A globally and superlinearly convergent algorithm for quadratic programming with simple bounds. SIAM J. Optim. 3, 298-321
3. Dongarra, J., Moler, C.B., Bunch, J.R., Stewart, G.W. (1988): An extended set of fortran basic linear algebra subprogram. ACM Trans. Math. Software 14, 1-17
4. Fletcher, R. (1993): Resolving degeneracy in quadratic programming. Ann. Oper. Res. 47, 307-334
5. Higham, N.J. (1987): A survey of condition number estimation for triangular matrices. SIAM Rev. 29, 575-596
6. Han, C-G., Pardalos, P., Ye, Y. (1990): Computational aspects of an interior point algorithm for quadratic programming problems with box constraints. In: Coleman, T., Li, Y., Eds., Large scale numerical optimization, pp. 92-112, SIAM, Philadelphia
7. Huber, P. (1981): Robust Statistics. Wiley, New York
8. Li, W. (1995): Linearly convergent descent methods for unconstrained minimization of convex quadratic splines. J. Optim. Theory Appl. 86, 145-172
9. Li, W. (1996): A conjugate gradient method for unconstrained minimization of strictly convex quadratic splines. Math. Prog. 72, 17-32
10. Li, W., Swetits, J. (1993): A Newton method for convex regression, data smoothing, and quadratic programming with bounded constraints. SIAM J. Optim. 3, 466-468
11. Li, W., Swetits, J. (1997): A new algorithm for solving strictly convex quadratic programs. SIAM J. Optim. 7, 595-619
12. Madsen, K., Nielsen, H.B. (1990): Finite algorithms for robust linear regression. BIT 30, 682-699
13. I estimation. SIAM J. Optim. 3, 223-235
14. Madsen, K., Nielsen, H.B., Pinar, M.Ç. (1995): A new finite continuation algorithm for bound constrained quadratic programming. To appear in SIAM J. Optim.
15. Madsen, K., Nielsen, H.B., Pinar, M.Ç. (1996): A new finite continuation algorithm for linear programming. SIAM J. Optim. 6, 600-616
16. Moré, J., Toraldo, G. (1989): Algorithms for bound constrained quadratic programming problems. Numer. Math. 55, 377-400
17. 1 estimation, Report NI-91-01. Institute for Numerical Analysis, Technical University of Denmark, DK-2800 Lyngby, Denmark
18. Nielsen, H.B. (1996): Bound constrained quadratic programming solved via piecewise quadratic functions: implementation, Report IMM-REP-1996-21. Department of Mathematical Modelling, Technical University of Denmark, DK-2800 Lyngby, Denmark, Available as http://www.imm.dtu.dk/̃hbn/publ/TR9621.ps
19. Rockafellar, R.T. (1970): Convex analysis. Princeton University Press, Princeton, NJ