An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
Crossref DOI link: https://doi.org/10.1007/s10107-021-01692-5
Published Online: 2021-07-21
Published Print: 2022-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Laiu, M. Paul http://orcid.org/0000-0002-2215-6968
Tits, André L.
Text and Data Mining valid from 2021-07-21
Version of Record valid from 2021-07-21
Article History
Received: 20 December 2019
Accepted: 2 July 2021
First Online: 21 July 2021