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

DOI10.1080/02331930701421095MaRDI QIDQ5423153zbMATH OpenOpenAlexFDO

Authors 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 methodobject-oriented softwareQuadratic programmingsuperfluous restrictions

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2159159
• Identifying non-active restrictions in convex quadratic programming
• Adaptive constraint reduction for convex quadratic programming
• Characterization of optimal points in binary convex quadratic programming
• Redundancies in positive-semidefinite quadratic programming

Cites work

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

Cited in

(3)

• Identifying non-active restrictions in convex quadratic programming
• scientific article; zbMATH DE number 2159159 (Why is no real title available?)
• Characterization of optimal points in binary convex quadratic programming

Describes a project that uses

Uses Software

• TAO

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5423153)