A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines

Mathematical Programming, Series B

Volumn 72, Issue 1, 1996, Pages 17-32

  Li, Wu ^a  

^a OLD DOMINION UNIVERSITY   (United States)

Author keywords

Conjugate gradient methods; Finite convergence; Global error estimates; Linear convergence; Nondegenerate solutions; Piecewise linear equations; Quadratic programs with simple bound constraints; Unconstrained minimization of a convex quadratic spline

Indexed keywords

EID: 0002450657     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592329     Document Type: Article

References (33)

1. M. Al-Baali, "Descent property and global convergence of the Fletcher-Reeves method with inexact line-search," IMA Journal of Numerical Analysis 5 (1985) 121-124.
2. E.M.L. Beale, "A derivation of conjugate gradients," in: F.A, Lootsma, ed., Numerical Methods for Nonlinear Optimization (Academic Press, London, 1972) pp. 39-43.
3. P. Brucker, "An O(n) algorithm for quadratic knapsack problems," Operations Research Letters 3 (3) (1984) 163-166.
4. P.H. Calamai and J.J. Moré, "Quasi-Newton updates with bounds," SIAM Journal on Numerical Analysis 24 (1987) 1434-1441.
5. R.W. Cottle, J.-S. Pang and R.E. Stone, The Linear Complementarity Problem (Academic Press, Boston, MA, 1992).
6. M.A. Diamond, "The solution of a quadratic programming problem using fast methods to solve systems of linear equations," International Journal of Systems Science 5 (1974) 131-136.
7. R. Fletcher and C.M. Reeves, "Function minimization by conjugate gradients," The Computer Journal 1 (1964) 143-154.
8. M. Frank and P. Wolfe, "An algorithm for quadratic programming," Naval Research Logistics Quarterly 3 (1956) 95-110.
9. A. Friedlander and J.M. Martínez, "On the maximization of a concave quadratic function with box constraints," SIAM Journal on Optimization 4 (1994) 177-192.
10. T. Gal, ed., Degeneracy in Optimization Problems, Annals of Operations Research 46/47 (1993).
11. T. Gal, Postoptimal Analyses, Parametric Programming, and Related Topics: Degeneracy, Multicriteria Decision Making Redundancy (De Gruyter, New York, 1994).
12. C.-G. Han, P.M. Pardalos and Y. Ye, "Computational aspects of an interior point algorithm for quadratic problems with box constraints," in: T. Coleman and Y. Li, eds., Large-Scale Numerical Optimization (SIAM, Philadelphia, PA, 1990) pp. 92-112.
13. C.-G. Han, P.M. Pardalos and Y. Ye, "An interior point algorithm for large-scale quadratic problems with box constraints," in: A. Bensoussan and J.L. Lions, eds., Analysis and Optimization of Systems: Proceedings of the 9th International Conference (Springer, New York, 1990) pp. 413-422.
14. C.-G. Han, P.M. Pardalos and Y. Ye, "On the solution of indefinite quadratic problems using an interior point algorithm," Informatica 3 (1992) 474-496.
15. Y.F. Hu and C. Storey, "Efficient generalized conjugate gradient algorithms, Part 1: Theory," Journal of Optimization Theory and Applications 69 (1991) 129-137.
16. Y.F. Hu and C. Storey, "Efficient generalized conjugate gradient algorithms, Part 2: Implementation," Journal of Optimization Theory and Applications 69 (1991) 139-152.
17. Y.F. Hu and C. Storey, "Global convergence result for conjugate gradient methods," Journal of Optimization Theory and Applications 71 (1991) 399-405.
18. W. Li, "Error bounds for piecewise convex quadratic programs and applications," SIAM Journal on Control and Optimization 33 (1995) 1510-1529.
19. W. Li, "Linearly convergent descent methods for unconstrained minimization of a convex quadratic spline," Journal of Optimization Theory and Applications 86 (1995) 145-172.
20. W. Li, P. Pardalos and C.G. Han, "Gauss-Seidel method for least distance problems," Journal of Optimization Theory and Applications 75 (1992) 487-500.
21. W. Li and J. Swetits, "A Newton method for convex regression, data smoothing, and quadratic programming with bounded constraints," SIAM Journal on Optimization 3 (1993) 466-488.
22. W. Li and J. Swetits, "A new algorithm for strictly convex quadratic programs," SIAM Journal on Optimization, to appear.
23. Y.Y. Lin and J.-S. Pang, "Iterative methods for large convex quadratic programs: A survey," SIAM Journal on Control and Optimization 25 (1987) 383-411.
24. J.J. Moré and G. Toraldo, "On the solution of large quadratic programming problems with bound constraints," SIAM Journal on Optimization 1 (1991) 93-113.
25. D.P. O'Leary, "A generalized conjugate gradient algorithm for solving a class of quadratic programming problems," Linear Algebra and its Applications 34 (1980) 371-399.
26. P.M. Pardalos, C.-G. Han and Y. Ye, "Interior point algorithms for solving nonlinear optimization problems," COAL Newsletter 19 (1991) 45-54.
27. P.M. Pardalos and N. Kovoor, "An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds," Mathematical Programming 46 (3) (1990) 321-328.
28. E. Polak and G. Ribière, "Note sur la convergence des méthodes de directions conjuguées," RAIRO Recherche Opérationelle 16 (1969) 35-43.
29. B.T. Polyak, "The conjugate gradient method in extremal problems," USSR Computational Mathematics and Mathematical Physics 9 (1969) 94-112.
30. M.J.D. Powell, "Some convergence properties of the conjugate gradient method," Mathematical Programming 11 (1) (1976) 42-49.
31. M.J.D. Powell, "Restart procedures for the conjugate gradient method," Mathematical Programming 12 (2) (1977) 241-254.
32. D. Touati-Ahmed and C. Storey, "Efficient hybrid conjugate gradient techniques," Journal of Optimization Theory and Applications 64 (1990) 379-397.
33. E.K. Yang and J.W. Tolle, "A class of methods for solving large, convex quadratic programs subject to box constraints," Mathematical Programming 51 (2) (1991) 223-228.