Subspace Search Method for Quadratic Programming with Box Constraints

Journal of Computational Mathematics

Volumn 17, Issue 3, 1999, Pages 307-314

  Wei, Zi Luan ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Matrix splitting; Quadratic programing; Subspace search method

Indexed keywords

EID: 33746174279     PISSN: 02549409     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. D.P. Bertsekas, Projected Newton method for optimization problems with simple constraints, SIAM J. Control Optimization, 20 (1932), 221-246.
2. Zhongzhi Bai, Parallel matrix multisplitting block relaxation methods, Math. Numer. Sinica, 17 (1995), 238-252 (in Chinese).
3. A. Berman , R.J. Plemmons, Nonnegative Matrices in the Mathematical Sciences, Academic Press, New York, 1979.
4. T.F. Coleman, L.A. Hulbert, A direct active set algorithm for large sparse quadratic program with simple bounds, Mathematical Programming, 45 (1989), 373-406.
5. A.R. Conn, N.I.M. Gould , Ph.L. Toint, Testing a class of methods for solving minimization problems with simple bounds on variables, Math. Comp., 50 (1988), 399-430.
6. J.C. Dunn, On the convergence of projected gradient processes to singular critical point, J. Optim. Theory Appl, 55 (1987), 203-216.
7. A. Friedlander, J.M. Martinez, On the maximization of a concave quadratic function with box constraints, SI AM J. Optimization, 4 (1994), 177-192.
8. R. Fletcher, Practical Methods of Optimization, 2-nd ed., John Wiley, Chichester, New York, 1987.
9. G.G. Han, P.M. Pardalos, Y. Ye, Computational aspects of an interior point algorithm for quadratic programming problem with box constraints, in Large Scale Numerical Optimization, T.Coleman and Y.Ye, eds., Society for Industrial and Applied Mathematics, Philadephia, PA, 1990.
10. O.L. Mangasarian, Parallel gradient distribution in unconstrained optimizatin, SIAM J. Control and Optimization, 4 (1995), 1916-1925.
11. J.J. More, G. Toraldo, Algorithm for bound constrained quadratic programming problems, Numerical Math., 55 (1989), 277-400.
12. On the solution of large quadratic programming problems with bound constraints, SIAM J. Optimization, 1 (1991), 93-113.
13. M.P. Mekenna, J.P. Mesirov, S.A. Zenios, Data parallel quadratic programming on box constrained problem, SIAM J. Optimization, 4 (1995), 570-589.
14. R.S. Varga, Matrix Iterative Analysis, Pientice-Hall, Englewood Cliffs, N.J., 1962.
15. Y. Yuan, Numerical Methods for Nonlinear Programming, Shanghai Scientific and Technical Publishers, 1993 (in Chinese).