The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Object-oriented software for quadratic programming
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Primal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
Self-citationBalay, S., Abhyankar, S. G., Adams, M. F., Brown, J., Brune, P., Buschelman, K., Dalcín, L., Dener, A., Eijkhout, Gropp, W., et al. (2019) · Cited by 1,967
Iterative methods for linear and nonlinear equations
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4556 · Cited by 1,947
On the Implementation of a Primal-Dual Interior Point Method
Mehrotra, S. (1992) · SIAM Journal on Optimization · doi:10.1137/0802028 · Cited by 1,613
QMR: a quasi-minimal residual method for non-Hermitian linear systems
Freund, R. W., & Nachtigal, N. M. (1991) · Numerische Mathematik · doi:10.1007/bf01385726 · Cited by 979
A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
Freund, R. W. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914029 · Cited by 623
Multiple centrality corrections in a primal-dual method for linear programming
Gondzio, J. (1996) · Computational Optimization and Applications · doi:10.1007/bf00249643 · Cited by 243
Demmel, J. W., Gilbert, J. R., & Li, X. S. (1999) · doi:10.2172/751785 · Cited by 220
Interior-Point Methods for Massive Support Vector Machines
Ferris, M. C., & Munson, T. S. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623400374379 · Cited by 186
Robust linear and support vector regression
Mangasarian, O. L., & Musicant, D. R. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.877518 · Cited by 186
Cited by
CasADi: a software framework for nonlinear optimization and optimal control
Andersson, J. A. E., Gillis, J., Horn, G., Rawlings, J. B., & Diehl, M. (2019) · Mathematical Programming Computation · doi:10.1007/s12532-018-0139-4 · Cited by 3,868
qpOASES: a parametric active-set algorithm for quadratic programming
Ferreau, H. J., Kirches, C., Potschka, A., Bock, H. G., & Diehl, M. (2014) · Mathematical Programming Computation · doi:10.1007/s12532-014-0071-1 · Cited by 1,265
OSQP: an operator splitting solver for quadratic programs
Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020) · Mathematical Programming Computation · doi:10.1007/s12532-020-00179-2 · Cited by 1,213
All you need to know about model predictive control for buildings
Drgoňa, J., Arroyo, J., Cupeiro Figueroa, I., Blum, D., Arendt, K., Kim, D., Ollé, E. P., Oravec, J., Wetter, M., Vrabie, D. L., et al. (2020) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2020.09.001 · Cited by 1,020
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
Metadata
- Authors
- Gertz, E. M., & Wright, S. J.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2003-03
- Volume
- 29
- Issue
- 1
- Pages
- 58-81
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2080514141
- Cited by
- 253
- References
- 11
- FWCI
- 9.97
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.