An interior point method for general large-scale quadratic programming problems
From MaRDI portal
Publication:1915920
DOI10.1007/BF02206825zbMath0848.90098MaRDI QIDQ1915920
Paul D. Domich, Paul T. Boggs, Janet E. Rogers
Publication date: 1 July 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
method of centers; interior point algorithm; nonconvex quadratic programs; Big-\({\mathcal M}\) Phase I procedure; cost improvement subproblem; multidirectional search direction; recentering
Related Items
A generalized computing paradigm based on artificial dynamic models for mathematical programming, Sequential quadratic programming for large-scale nonlinear optimization, Joint optimization of pricing and planning decisions in divergent supply chain
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A little theorem of the big \({\mathcal M}\) in interior point algorithms
- A long-step barrier method for convex quadratic programming
- Computational experience with a primal-dual interior point method for linear programming
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming
- The polyadic structure of factorable function tensors with applications to high-order minimization techniques
- On the big \({\mathcal M}\) in the affine scaling algorithm
- An interior Newton method for quadratic programming
- Symmetric indefinite systems for interior point methods
- An implementation of Karmarkar's algorithm for linear programming
- Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
- Commentary—Interior-Point Methods: Algorithms and Formulations
