Exterior Newton method for strictly convex quadratic programming

Computational Optimization and Applications

Volumn 15, Issue 1, 2000, Pages 5-32

  Coleman, Thomas F ^a   Liu, Jianguo ^b  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING;

CONVEX QUADRATIC PROGRAMMING; EXTERIOR NEWTON METHOD;

QUADRATIC PROGRAMMING;

EID: 0033640472     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008773230148     Document Type: Article

References (25)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, 1974.
2. A.B. Berkelaar, C. Roos, and T. Terlaky, "The optimal set and optimal partition approach to linear and quadratic programming," Chapter 6 in Advances in Sensitivity Analysis and Parametric Programming, H.J. Greenberg and T. Gal (Eds.), Kluwer Academic Publishers: Dordrecht, 1997.
3. T.J. Carpenter and D.E. Shanno, "An interior point method for quadratic programs based on conjugate projected gradients," Computational Optimization and Applications, vol. 2, pp. 5-28 (1993).
4. T.F. Coleman and L.A. Hulbert, "A globally and superlinearly convergent algorithm for convex quadratic programming with simple bounds," SIAM Journal on Optimization, vol. 3, pp. 298-321 (1993).
5. J.E. Dennis, Jr. and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall: Englewood Cliffs, NJ, 1983.
6. I.I. Dikin, "Iterative solution of problems of linear and quadratic programming," Soviet Mathematics Doklady, vol. 8, pp. 674-675 (1967).
7. R. Fletcher, Practical Methods of Optimization, 2nd edition, John Wiley and Sons: New York, 1987.
8. P.E. Gill, W. Murray, and M.H. Wright, Practical Optimization, Academic Press: London, 1981.
9. D. Goldfarb, "Extensions of Newton's method and simplex methods for solving quadratic programs," in Numerical Methods for Nonlinear Optimization, F.A. Lootsman (Ed.), Academic Press: London, 1972.
10. 3 L) primal interior point algorithm for convex quadratic programming," Mathematical Programming, vol. 49, pp. 325-340 (1991).
11. G.H. Golub and C.F. Van Loan, Matrix Computations, 2nd edition, The Johns Hopkins University Press, 1989.
12. E.V. Haynsworth, "Determination of the inertia of a partitioned Hermitian matrix," Linear Algebra and its Applications, vol. 1, pp. 73-81 (1968).
13. D. Hertog, C. Roos, and T. Terlaky, "A polynomial method of weighted centers for convex quadratic programming," J. Inform. Optim. Sci., vol. 12, pp. 187-205 (1991).
14. W. Li and J. Swetits, "A new algorithm for solving strictly convex quadratic programs," SIAM Journal on Optimization, to appear.
15. K. Madsen, H. Nielsen, and M. Pinar, "A new finite continuation algorithm for bound constrained quadratic programming," Tech. Report, IMM-REP-1995-22, Institute of Mathematical Modeling, Technical University of Denmark, 1995.
16. 3.5 L) arithmetic operations," Math. Oper. Res., vol. 15, pp. 342-363 (1990).
17. R. Monteiro and I. Adler, "Interior path-following primal-dual algorithms, part II: Convex quadratic programming," Mathematical Programming, vol. 44, pp. 43-66 (1989).
18. J.J. Moré and D. Sorensen, "Computing a trust region step," SIAM Journal on Scientific and Statistical Computing, vol. 4, pp. 553-572 (1983).
19. J.J. Moré and G. Toraldo, "Algorithms for bound constrained quadratic programming problems," Numerische Mathematik, vol. 55, pp. 377-400 (1989).
20. R.T. Rockafellar, Convex Analysis, Princeton University Press, 1970.
21. D. Sorensen, "Trust region methods for unconstrained optimization," SIAM Journal on Numerical Analysis, vol. 19, pp. 409-426 (1982).
22. T. Tsuchiya, "Affine scaling algorithm," Interior Point Methods of Mathematical Programming, T. Terlaky (Ed.), Kluwer Academic Publishers: Dordrecht, 1996.
23. D.G. Wilson, "A brief introduction to the IBM optimization subroutine library," SIAG/OPT Views and News, vol. 1, pp. 9-10 (1992).
24. P. Wolfe, "The simplex method for quadratic programming," Econometrica, vol. 27, pp. 382-398 (1959).
25. Y. Ye, "Interior point algorithms for quadratic programming," in Recent Developments in Mathematical Programming, S. Kumar (Ed.), Gordon & Beach Scientific Publishers: Philadelphia, 1991.