Worst-case complexity of cyclic coordinate descent: $$O(n^2)$$ gap with randomized version
Crossref DOI link: https://doi.org/10.1007/s10107-019-01437-5
Published Online: 2019-10-11
Published Print: 2021-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Sun, Ruoyu http://orcid.org/0000-0003-2487-5322
Ye, Yinyu
Text and Data Mining valid from 2019-10-11
Version of Record valid from 2019-10-11
Article History
Received: 18 September 2017
Accepted: 22 September 2019
First Online: 11 October 2019