HOPDM | Extended Name | High Order Primal Dual Method |
Authors | Jacek Gondzio
Department of Mathematics and Statistics The University of Edinburgh James Clerk Maxwell Building King's Buildings Mayfield Road Edinburgh EH9 3JZ, U.K. Fax No: +44 131 650 6553 E-mail: gondzio@maths.ed.ac.uk Anna Altman
| |
Language | FORTRAN (F77) | |
Algorithm | Interior Point | |
Version | 2.13 for LP | |
Input Format | MPS | |
Modeling Languages link | AMPL | |
Commercial Status | free | |
Platform | PC, Unix | |
Remarks | HOPDM is a package for solving large scale linear and convex quadratic programming problems. The code is an implementation of the infeasible primal-dual interior point method. It uses multiple centrality correctors; their number is chosen appropriately for a given problem in order to reduce the overall solution time. HOPDM automatically chooses the most appropriate factorization method for a given problem (either normal equations or augmented system).
You can see general information about HOPDM and get HOPDM F77 source code (version 2.13, free of charge). A comparison between HOPDM and some other IP package for LP is given in Hans Mittelmann (mittelmann@asu.edu) benchmark: | |
References |
|