An interior point method for general large-scale quadratic programming problems
- 1 December 1996
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 62 (1) , 419-437
- https://doi.org/10.1007/bf02206825
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Commentary—Interior-Point Methods: Algorithms and FormulationsINFORMS Journal on Computing, 1994
- A Long-step barrier method for convex quadratic programmingAlgorithmica, 1993
- A little theorem of the bigℳ in interior point algorithmsMathematical Programming, 1993
- On the bigℳ in the affine scaling algorithmMathematical Programming, 1993
- Symmetric indefinite systems for interior point methodsMathematical Programming, 1993
- Optimizing over three-dimensional subspaces in an interior-point method for linear programmingLinear Algebra and its Applications, 1991
- Implementation of a Dual Affine Interior Point Algorithm for Linear ProgrammingINFORMS Journal on Computing, 1989
- Algorithmic Enhancements to the Method of Centers for Linear Programming ProblemsINFORMS Journal on Computing, 1989
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- The polyadic structure of factorable function tensors with applications to high-order minimization techniquesJournal of Optimization Theory and Applications, 1986