The DOI matches its Crossref record.
Symmetric Quasidefinite Matrices
Abstract
It is stated here that a symmetric matrix K is quasidefinite if it has the form \[ K = \begin{bmatrix} - E & A^T \\ A & F \end{bmatrix}, \] where E and F are symmetric positive definite matrices. Although such matrices are indefinite, it is shown that any symmetric permutation of a quasidefinite matrix yields a factorization $LDL^T $. This result is applied to obtain a new approach for solving the symmetric indefinite systems arising in interior-point methods for linear and quadratic programming. These systems are typically solved either by reducing to a positive definite system or by performing a Bunch–Parlett factorization of the full indefinite system at every iteration. This is an intermediate approach based on reducing to a quasidefinite system. This approach entails less fill-in than further reducing to a positive definite system, but is based on a static ordering and is therefore more efficient than performing Bunch–Parlett factorizations of the original indefinite system.
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
Cited by
Numerical solution of saddle point problems
Benzi, M., Golub, G. H., & Liesen, J. (2005) · Acta Numerica · doi:10.1017/s0962492904000212 · Cited by 2,300
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
CVXGEN: a code generator for embedded convex optimization
Mattingley, J., & Boyd, S. (2012) · Optimization and Engineering · doi:10.1007/s11081-011-9176-9 · Cited by 790
ECOS: An SOCP solver for embedded systems
Domahidi, A., Chu, E., & Boyd, S. (2013) · 2013 European Control Conference (ECC) · doi:10.23919/ecc.2013.6669541 · Cited by 727
Interior Methods for Nonlinear Optimization
Forsgren, A., Gill, P. E., & Wright, M. H. (2002) · SIAM Review · doi:10.1137/s0036144502414942 · Cited by 699
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S. (2016) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-016-0892-3 · Cited by 664
An Interior-Point Algorithm for Nonconvex Nonlinear Programming
Vanderbei, R. J., & Shanno, D. F. (1999) · Computational Optimization and Applications · doi:10.1023/a:1008677427361 · Cited by 526
Self-citationLOQO:an interior point code for quadratic programming
Vanderbei, R. J. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805759 · Cited by 471
Self-citationInterior point methods 25 years later
Gondzio, J. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.09.017 · Cited by 377
Large-Scale Convex Optimization for Dense Wireless Cooperative Networks
Shi, Y., Zhang, J., O'Donoghue, B., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2443731 · Cited by 118
Metadata
- Authors
- Vanderbei, R. J.
- Venue
- SIAM Journal on Optimization
- Published
- 1995-02
- Volume
- 5
- Issue
- 1
- Pages
- 100-113
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W40680864
- Cited by
- 202
- References
- 0
- FWCI
- 5.61
- 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.