HOPDM - a higher order primal-dual method for large scale linear programming

DOI10.1016/0377-2217(93)90214-8zbMath0775.90285OpenAlexW1967947961MaRDI QIDQ1207069

Jacek Gondzio, Anna Altman

Publication date: 3 May 1993

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

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90214-8

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method, Solving a class of LP problems with a primal-dual logarithmic barrier method, QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming, A primal-dual regularized interior-point method for convex quadratic programs, Cost-effective sulphur emission reduction under uncertainty, HOPDM, High-performance sampling of generic determinantal point processes

Uses Software

• IPMLO
• QHOPDM

Cites Work

• Unnamed Item
• Unnamed Item
• Implementing cholesky factorization for interior point methods of linear programming
• Splitting dense columns of constraint matrix in interior point methods for large scale linear programming¹¹The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France$ef:²²A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-…
• The design and application of IPMLO. A FORTRAN library for linear optimization with interior point methods