We construct a class of path-following algorithms for solving semidefinite problems with linear–quadratic functionals. Complexity estimates similar to the best known for the case of the standard convex quadratic programming problem are obtained. Complete proofs of all results are included.
No takes yet. Share an insight, caveat, or question.
Leonid Faybusovich (1996) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: