  


ObjectOriented Software for Quadratic Programming
E. M. Gertz (gertzmcs.anl.gov) Abstract: We describe the objectoriented software package OOQP for solving convex quadratic programming problems (QP). The primaldual 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, boundconstrained 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. Keywords: convex quadratic programming, objectoriented software, intereiorpoint methods Category 1: Optimization Software and Modeling Systems (Optimization Software Design Principles ) Category 2: Nonlinear Optimization (Quadratic Programming ) Citation: Preprint ANL/MCSP8911000, Mathematics and Computer Science Division Argonne Natioanl Laboratory; Optimization Technical Report 0102, Computer Sciences Department, University of WisconsinMadison. Revised December, 2002. Published in ACM Transactions on Mathematical Software 29 (2003), pp. 5881. Download: [PDF] Entry Submitted: 10/25/2001 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  