SAL Home NUMERICS Optimization


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). The code compares favourably with commercial LP and QP packages.

Current Version:   2.30

License Type:   Public Domain (for version 2.13 FORTRAN code)

Home Site:

Source Code Availability:

Yes, new version upon request through author

Available Binary Packages:

  • Debian Package: No
  • RedHat RPM Package: No
  • Other Packages: No

Targeted Platforms:

Version 2.13 works on Fortran platforms. Minor changes might be needed (in makefile and in mytime.f) to make HOPDM operational on some platform like HP, SGI, DEC or Linux. The new version of HOPDM has a form of a C callable library.

Software/Hardware Requirements:

Fortran compiler for version 2.13; C compiler for version 2.30

Other Links:

Mailing Lists/USENET News Groups:


User Comments:

  • None

See A Screen Shot? (Not Yet)

  SAL Home   |   Numerical Analysis   |   Optimization

Comments? SAL@KachinaTech.COM
Copyright © 1995-2001 by Herng-Jeng Jou
Copyright © 1997-2001 by Kachina Technologies, Inc.
All rights reserved.