QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming

DOI10.1016/0377-2217(95)00183-QzbMath0914.90211MaRDI QIDQ1390273

Anna Altman

Publication date: 23 June 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

interior point methodslinear constraintsconvex quadratic optimizationhigher-order logarithmic barrier primal-dual method

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20)

Related Items (4)

HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method ⋮ QHOPDM ⋮ Sparsity in convex quadratic programming with interior point methods ⋮ Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization

Uses Software

• LOQO
• HOPDM

Cites Work

• Unnamed Item
• Unnamed Item
• HOPDM - a higher order primal-dual method for large scale linear programming
• Cost-effective sulphur emission reduction under uncertainty
• Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure
• LOQO user's manual — version 3.10

This page was built for publication: QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming