Object-oriented software for quadratic programming
Edward Michael Gertz, Stephen J. Wright · ACM Transactions on Mathematical Software · 2003
The object-oriented software package OOQP for solving convex quadratic programming problems (QP) is described. The primal-dual interior point algorithms supplied by OOQP are implemented in a way that is largely independent of the problem structure. Users may exploit problem structure by supplying linear algebra, problem data, and variable classes that are customized to their particular applications. The OOQP distribution contains default implementations that solve several important QP problem types, including general sparse and dense QPs, bound-constrained QPs, and QPs arising from support vector machines and Huber regression. The implementations supplied with the OOQP distribution are based on such well known linear algebra packages as MA27/57, LAPACK, and PETSc. OOQP demonstrates the usefulness of object-oriented design in optimization software development, and establishes standards that can be followed in the design of software packages for other classes of optimization problems. A number of the classes in OOQP may also be reusable directly in other codes.
Cited by 253 works. doi:10.1145/641876.641880
Authors
References
- The Nature of Statistical Learning Theory
- Primal-Dual Interior-Point Methods
- On the Implementation of a Primal-Dual Interior Point Method
- Iterative methods for linear and nonlinear equations
- PETSc Users Manual
- QMR: a quasi-minimal residual method for non-Hermitian linear systems
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- Interior-Point Methods for Massive Support Vector Machines
- Implementation of the GMRES Method Using Householder Transformations
- MA27 -- A set of Fortran subroutines for solving sparse symmetric sets of linear equations