An interior Newton method for quadratic programming

Mathematical Programming, Series B

Volumn 85, Issue 3, 1999, Pages 491-523

  Coleman, Thomas F ^a   Liu, Jianguo ^b,c  

^a Cornell University ^*  (United States)

^b Department of Molecular Biology and Genetics   (United States)

^c UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Dogleg method; Interior method; Newton method; Nonconvex quadratic programming; Quadratic convergence; Trust region method

Indexed keywords

EID: 0001173687     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050069     Document Type: Article

References (13)

1. Barnes, E.R. (1986): A variation on Karmarkar's algorithm for solving linear programming problems. Math. Program. 36, 174-182
2. Ben Daya, M., Shetty, C.M. (1988): Polynomial barrier function algorithm for convex quadratic programming. Report J 88-5, School of ISE, Georgia Institute of Technology, Atlanta, GA
3. Beale, E.M.L. (1959): On quadratic programming. Naval Research Logistics Quarterly 6, 227-243
4. Byrd, R.H., Schnabel, R.B. (1986): Continuity of the null space and constrained optimization. Math. Program. 35, 32-41
5. Calamai, PH., Moré, J.J. (1987): Projected gradient methods for linearly constrained problems. Math. Program. 39, 93-116
6. Coleman, T.F., Hulbert, L.A. (1989): A direct active set algorithm for large sparse quadratic programs with simple bounds. Math. Program. 45, 373-406
7. Coleman, T.F., Li, Y. (1994): On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds. Math. Program. 67, 189-224
8. Coleman, T.F., Li, Y. (1996): An interior trust region approach for nonlinear minimization subject to bounds. SIAM J. Optim. 6, 418-445
9. Coleman, T.F., Liu, J. (1993): An interior Newton method for quadratic programming. Tech. Rep. 93-1388, Computer Science Department, Cornell University, Ithaca, NY
10. Coleman, T.F., Sorensen, D. (1984): A note on the computation of an orthonormal basis for the null space of a matrix. Math. Program. 29, 234-242
11. Cottle, R.W., Dantzig, G.B. (1968): Complementary pivot theory of mathematical programming. Linear Algebra Appl. 1, 103-125
12. Dennis, Jr., J.E., Schnabel, R.B. (1983): Numerical Methods for Unconstrained Optimization and Non-linear Equations. Prentice-Hall, Englewood Cliffs, NJ
13. Dikin, I.I. (1967): Iterative solution of problems of linear and quadratic programming. Sov. Math. Dokl. 8, 674-675