Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming

DOI10.1080/02331930701421095zbMath1148.90337OpenAlexW2050604003MaRDI QIDQ5423153

Philipp Schade, Peter Recht

Publication date: 22 October 2007

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930701421095

zbMATH Keywords

interior-point methodQuadratic programmingobject-oriented softwaresuperfluous restrictions

Mathematics Subject Classification ID

Quadratic programming (90C20) Interior-point methods (90C51)

Uses Software

• TAO

Cites Work

• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• Redundancies in positive-semidefinite quadratic programming
• A ``build-down scheme for linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
• On Khachian's algorithm and minimal ellipsoids
• Identifying non-active restrictions in convex quadratic programming
• Parallel interior-point solver for structured linear programs
• Multiple centrality corrections in a primal-dual method for linear programming
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• On the Implementation of a Primal-Dual Interior Point Method
• Object-oriented software for quadratic programming
• GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization

This page was built for publication: Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming