A numerically stable dual method for solving strictly convex quadratic programs
Mathematical Programming1983Vol. 27(1), pp. 1–33
Citations Over TimeTop 10% of 1983 papers
Related Papers
- → Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming(1999)55 cited
- → Iterative Refinement of the Solution of a Positive Definite System of Equations(1971)44 cited
- → Pivot tightening for direct methods for solving symmetric positive definite systems of linear interval equations(2011)5 cited
- → Chapter 17: Positive definite matrices and Cholesky decomposition(2022)