HOPDM
Edit Page
Report
Scan day: 17 February 2014 UTC
23
Virus safety - good
Description: Package for solving large-scale linear, convex quadratic and convex nonlinear programming problems. The code is an implementation of the infeasible primal-dual interior point method, and compares favorably with commercial LP, QP and NLP packages.
is a package for solving large scale linear, convex quadratic and convex nonlinear 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 efficient factorization method for a given problem (either normal equations or augmented system). The code compares favourably with commercial LP, QP and NLP packages.
Size: 535 chars
Contact Information
Email: —
Phone&Fax: 10589-010-9361
Address: —
Extended: —
WEBSITE Info
| Page title: | HOPDM's home page |
| Keywords: | |
| Description: | |
| IP-address: | 129.215.255.75 |