A polynomial time infeasible interior-point arc-search algorithm for convex optimization
Crossref DOI link: https://doi.org/10.1007/s11081-022-09712-9
Published Online: 2022-03-31
Published Print: 2023-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Yang, Yaguang
Text and Data Mining valid from 2022-03-31
Version of Record valid from 2022-03-31
Article History
Received: 11 October 2021
Revised: 5 February 2022
Accepted: 6 February 2022
First Online: 31 March 2022