An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
Crossref DOI link: https://doi.org/10.1007/s11075-022-01279-x
Published Online: 2022-03-19
Published Print: 2022-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Yang, Yaguang http://orcid.org/0000-0002-2943-9389
Text and Data Mining valid from 2022-03-19
Version of Record valid from 2022-03-19
Article History
Received: 9 April 2021
Accepted: 8 February 2022
First Online: 19 March 2022
Declarations
:
: The author declares no competing interests.