An interior-point algorithm for large-scale quadratic problems with box constraints
- 11 June 2008
- book chapter
- Published by Springer Nature
- p. 413-422
- https://doi.org/10.1007/bfb0120064
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Algorithms for bound constrained quadratic programming problemsNumerische Mathematik, 1989
- An extension of Karmarkar's projective algorithm for convex quadratic programmingMathematical Programming, 1989
- Interior path following primal-dual algorithms. part II: Convex quadratic programmingMathematical Programming, 1989
- A direct method for sparse least squares problems with lower and upper boundsNumerische Mathematik, 1988
- Constrained Global Optimization: Algorithms and ApplicationsPublished by Springer Nature ,1987
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- The Method of Christopherson for Solving Free Boundary Problems for Infinite Journal Bearings by Means of Finite DifferencesMathematics of Computation, 1971