QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming
From MaRDI portal
Publication:1390273
DOI10.1016/0377-2217(95)00183-QzbMath0914.90211MaRDI QIDQ1390273
Publication date: 23 June 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
interior point methods; linear constraints; convex quadratic optimization; higher-order logarithmic barrier primal-dual method
90C25: Convex programming
90C06: Large-scale problems in mathematical programming
90C20: Quadratic programming
Related Items
Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization, QHOPDM, HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method, Sparsity in convex quadratic programming with interior point methods
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item