A block active set algorithm for large-scale quadratic programming with box constraints

Annals of Operations Research

Volumn 81, Issue , 1998, Pages 75-95

  Fernandes, L ^a   Fischer, A ^b   Judice J ^c   Requejo, C ^c   Soares, J ^c  

^a Escola Superior de Tecnologia de Tomar   (Portugal)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^c UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

Box constraints; Large scale problems; Quadratic programming; Sparse matrices

Indexed keywords

EID: 0032376802     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. D.P. Bertsekas, Constrained Optimization and Lagrange Multipliers Methods, Academic Press, New York, 1982.
2. E.M. Bomze and G. Danninger, A finite algorithm for solving general quadratic problems, Journal of Global Optimization 4(1994)1-16.
3. T. Coleman and L. Hulbert, A direct active set algorithm for large sparse quadratic programs with bounds, Mathematical Programming 45(1989)373-406.
4. T. Coleman and Y. Li, A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables, Technical Report TR 92-1315, Department of Computer Science, Cornell University, USA, 1992.
5. A. Conn, N. Gould and Ph. Toint, Global convergence of a class of trust regions algorithm for optimization with simple bounds, SIAM Journal on Numerical Analysis 25(1988)433-460.
6. I. Bongartz, A. Conn, N. Gould and Ph. Toint, CUTE: Constrained and unconstrained testing environment, Technical Report 93/10, Department of Mathematics, Faculté Universitaires ND de la Paix, Namur, Belgium, 1993.
7. J.W. Daniel, Stability of the solution of definite quadratic programs, Mathematical Programming 5(1973)41-53.
8. R. Dembo and U. Tulowitzski, On the minimization of quadratic functions subject to box constraints, Technical Report, Department of Computer Science, Yale University, USA, 1983.
9. I.S. Duff, R.G. Grimes and J.G. Lewis, Sparse matrix test problems, ACM Transactions on Mathematical Software 15(1989)1-14.
10. A. Faustino and J. Júdice, Minimization of a concave quadratic function subject to box constraints, Investigacion Operativa 4(1994)49-68.
11. A. Faustino and J. Júdice, Principal pivoting algorithms for a concave generalized linear complementarity problem, Investigação Operacional 14(1994)133-146.
12. L. Fernandes, J. Júdice and J. Patricio, An investigation of the interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Computational Optimization and Applications 5(1996)49-77.
13. R. Fletcher and M. Jackson, Minimization of a quadratic function subject only to upper and lower bounds, Journal of Mathematics and Applications 14(1974)159-174.
14. P. Hansen, B. Jaumard, M. Ruiz and J. Xiong, Global minimization of indefinite quadratic functions subject to box constraints, Naval Research Logistics 40(1993)373-392.
15. J. Júdice and M. Pires, Direct methods for convex quadratic programs subject to box constraints, Investigação Operacional 9(1989)23-56.
16. J. Júdice and F. Pires, A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems, Computers and Operations Research 21(1994)587-596.
17. A. Conn, N. Gould and Ph. Toint, LANCELOT - A Fortran Package for Large-Scale Nonlinear Optimization, Springer, 1992.
18. J. Moré and G. Toraldo, Algorithms for bound constrained quadratic programming problems, Numerische Mathematik 55(1989)377-400.
19. K. Murty, Linear Complementarity, Linear and Nonlinear Programming, Heldermann, Berlin, 1988.
20. P.M. Pardalos and G.P. Rodgers, A branch-and-bound algorithm for the maximum clique problem, Computers and Operations Research 19(1992)363-375.
21. J. Soares, J. Júdice, and F. Facchinei, An active set Newton method for large-scale nonlinear programs with box constraints, to appear in SIAM Journal on Optimization.