A trust region algorithm with a worst-case iteration complexity of $$\mathcal{O}(\epsilon ^{-3/2})$$ O ( ϵ - 3 / 2 ) for nonconvex optimization
Crossref DOI link: https://doi.org/10.1007/s10107-016-1026-2
Published Online: 2016-05-17
Published Print: 2017-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Curtis, Frank E. http://orcid.org/0000-0001-7214-9187
Robinson, Daniel P.
Samadi, Mohammadreza
Text and Data Mining valid from 2016-05-17
