A new algorithm for solving strictly convex quadratic programs

SIAM Journal on Optimization

Volumn 7, Issue 3, 1997, Pages 595-619

  Li, Wu ^a   Swetits, John ^a  

^a OLD DOMINION UNIVERSITY   (United States)

Author keywords

Active set methods; Convex quadratic programs; Convex quadratic splines; Exact penalty functions; Newton methods

Indexed keywords

EID: 0031285891     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623493246045     Document Type: Article

References (47)

1. D. P. BERTSEKAS, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.
2. T. F. COLEMAN AND L. A. HULBERT, A globally and superlinearly convergent algorithm for convex quadratic programs with simple bounds, SIAM J. Optim., 3 (1993), pp. 298-321.
3. A. R. CONN, N. I. M. GOULD, AND P. L. TOINT, A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds, SIAM J. Numer. Anal., 28 (1991), pp. 545-572.
4. I. C. DEMETRIOU AND M. J. D. POWELL, The minimum sum of squares change to univariate data that gives convexity, IMA J. Numer. Anal., 11 (1991), pp. 433-448.
5. J. E. DENNIS, JR. AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983.
6. G. DI PILLO AND L. GRIPPO, Exact penalty functions in constrained optimization, SIAM J. Control Optim., 27 (1989), pp. 1333-1360.
7. B. C. EAVES, On the basic theorem of complementarity, Math. Programming, 1 (1971), pp. 68-75.
8. A. S. EL-BAKRY, R. A. TAPIA, AND Y. ZHANG, A study of indicators for identifying zero variables in interior-point methods, SIAM Rev., 36 (1994), pp. 45-72.
9. A. V. FIACCO AND G. P. MCCORMICK, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley & Sons, Inc., New York, 1968.
10. M. FRANK AND P. WOLFE, An algorithm for quadratic programming, Naval Res. Logist., 3 (1956), pp. 95-110.
11. A. FRIEDLANDER AND J. M. MARTÍNEZ, On the maximization of a concave quadratic function with box constraints, SIAM J. Optim., 4 (1994), pp. 177-192.
12. P. E. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press, New York, 1981.
13. T. GLAD AND E. POLAK, A multiplier method with automatic limitation of penalty growth, Math. Programming, 17 (1979), pp. 140-155.
14. D. GOLDFARB AND A. IDNANI, A numerically stable dual method for solving strictly convex quadratic programs, Math. Programming, 27 (1983), pp. 1-33.
15. L. GRIPPO AND S. LUCIDI, On the solution of a class of quadratic programs using a differentiable exact penalty function, in System Modelling and Optimization, H. J. Sebastian and K. Tammer, eds., Leipzig, 1989, pp. 764-773, and Lecture Notes in Control and Information Science 143, Springer, Berlin, 1990.
16. L. GRIPPO AND S. LUCIDI, On the solution of a class of quadratic programs using a differentiable exact penalty function, in System Modelling and Optimization, H. J. Sebastian and K. Tammer, eds., Leipzig, 1989, pp. 764-773, and Lecture Notes in Control and Information Science 143, Springer, Berlin, 1990.
17. L. GRIPPO AND S. LUCIDI, A differentiable exact penalty function for bound constrained quadratic programming problems, Optimization, 22 (1991), pp. 557-578.
18. P. T. HARKER AND J.-S. PANG, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Math. Programming, 48 (1990), pp. 161-220.
19. IMSL 32-Bit Fortran Numerical Libraries, Visual Numerics, Inc., Houston, TX, 1994.
20. W. LI, Error bounds for piecewise convex quadratic programs and applications, SIAM J. Control Optim., 33 (1995), pp. 1510-1529.
21. W. LI, Remarks on convergence of the matrix splitting algorithm for the symmetric linear complementarity problem, SIAM J. Optim., 3 (1993), pp. 155-163.
22. W. LI, Linearly convergent descent methods for unconstrained minimization of a convex quadratic spline, J. Optim. Theory Appl., 86 (1995), pp. 145-172.
23. W. LI, A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines, Math. Programming, 72 (1996), pp. 17-32.
24. W. LI, Differentiable piecewise quadratic exact penalty functions for quadratic programs with simple bound constraints, SIAM J. Optim., 6 (1996), pp. 299-315.
25. W. LI, Differentiable Piecewise Quadratic Exact Penalty Functions for Convex Quadratic Programs with Linearly Independent Two-Sided Inequality Constraints, Preprint, Department of Mathematics and Statistics, Old Dominion University, Norfolk, VA, June 1995.
26. W. LI, D. NAIK, AND J. SWETITS, A data smoothing technique for piecewise convex/concave curves, SIAM J. Sci. Comput., 17 (1996), pp. 517-537.
27. W. LI, P. PARDALOS, AND C. G. HAN, Gauss-Seidel method for least distance problems, J. Optim. Theory Appl., 75 (1992), pp. 487-500.
28. 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.
29. Y. Y. LIN AND J. S. PANG, Iterative methods for large quadratic programs: A survey, SIAM J. Control Optim., 25 (1987), pp. 383-411.
30. Z.-Q. LUO, Convergence analysis of primal-dual interior point algorithms for convex quadratic programs, in Recent Trends in Optimization Theory and Applications, World Sci. Ser. Appl. Anal. 5, World Sci. Publishing, River Edge, NJ, 1995, pp. 255-270.
31. X.-D. LUO AND Z.-Q. LUO, Extension of Hoffman's error bound to polynomial systems, SIAM J. Optim., 4 (1994), pp. 383-392.
32. Z.-Q. LUO AND P. TSENG, Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem, SIAM J. Optim., 2 (1992), pp. 43-54.
33. Z.-Q. LUO AND P. TSENG, On the convergence of a matrix splitting algorithm for the symmetric monotone linear complementarity problem, SIAM J. Control Optim., 29 (1991), pp. 1037-1060.
34. O. L. MANGASARIAN, Solution of symmetric linear complementarity problems by iterative methods, J. Optim. Theory Appl., 22 (1977), pp. 465-485.
35. O. L. MANGASARIAN, Convergence of iterates of an inexact matrix splitting algorithm for the symmetric monotone linear complementarity problem, SIAM J. Optim., 1 (1991), pp. 114-122.
36. J. J. MORÉ AND G. TORALDO, On the solution of large quadratic programming problems with bound constraints, SIAM J. Optim., 1 (1991), pp. 93-113.
37. J. J. MORÉ AND S. J. WRIGHT, Optimization Software Guide, SIAM, Philadelphia, PA, 1993.
38. Y. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
39. J. M. ORTEGA AND W. C. RHEINBOLDT, Iterative Solutions of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
40. J. S. PANG, Methods for quadratic programming: A survey, Computers Chem. Engineering, 7 (1983), pp. 583-594.
41. P. M. PARDALOS AND N. KOVOOR, An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds, Math. Programming, 46 (1990), pp. 321-328.
42. M. J. D. POWELL, On the quadratic programming algorithm of Goldfarb and Idnani, Math. Programming Study, 25 (1985), pp. 46-61.
43. S. M. ROBINSON, Some continuity properties of polyhedral multifunctions, Math. Programming Study, 14 (1981), pp. 206-214.
44. R. T. ROCKAFELLAR, Monotone operators and the proximal point algorithm, SIAM J. Control Optim., 14 (1976), pp. 877-898.
45. R. J. VANDERBEI AND T. J. CARPENTER, Symmetric indefinite systems for interior point methods, Math. Programming, 58 (1993), pp. 1-32.
46. P. WOLFE, Convergence conditions for ascent methods, SIAM Rev., 11 (1969), pp. 226-235.
47. E. K. YANG AND J. W. TOLLE, A class of methods for solving large, convex quadratic program subject to box constraints, Math. Programming, 51 (1991), pp. 223-228.