Answers are grounded in this paper and cite their sources.
The paper describes the convex quadratic solver BPMPD Version 2.21. The solver is based on the infeasible–primal–dual algorithm extended by the predictor–corrector and target–following techniques. The discussion includes topics related to the implemented algorithm and numerical algebra employed. We outline the presolve, scaling and starting point stategies used in BPMPD, and special attention is given for sparsity and stability issues. Computational results are given on a demonstrative set of convex quadratic problems.
No takes yet. Share an insight, caveat, or question.
Csaba Mészáros (1999) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: