A direct active set algorithm for large sparse quadratic programs with simple bounds
- 1 August 1989
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 45 (1-3), 373-406
- https://doi.org/10.1007/bf01589112
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple BoundsSIAM Journal on Numerical Analysis, 1988
- A direct method for sparse least squares problems with lower and upper boundsNumerische Mathematik, 1988
- A chordal preconditioner for large-scale optimizationMathematical Programming, 1988
- Testing a class of methods for solving minimization problems with simple bounds on the variablesMathematics of Computation, 1988
- Projected gradient methods for linearly constrained problemsMathematical Programming, 1987
- Projected Newton Methods for Optimization Problems with Simple ConstraintsSIAM Journal on Control and Optimization, 1982
- A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefrontInternational Journal for Numerical Methods in Engineering, 1979
- LINPACK Users' GuidePublished by Society for Industrial & Applied Mathematics (SIAM) ,1979
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper BoundsIMA Journal of Applied Mathematics, 1974
- A General Quadratic Programming AlgorithmIMA Journal of Applied Mathematics, 1971