A trust region algorithm with a worst-case iteration complexity of $$\mathcal{O}(\epsilon ^{-3/2})$$ O ( ϵ - 3 / 2 ) for nonconvex optimization
Frank E. Curtis, Daniel P. Robinson, Mohammadreza Samadi · Mathematical Programming · 2016
Cited by 157 works. doi:10.1007/s10107-016-1026-2
Authors
References
- Nonlinear Programming
- Numerical Methods for Unconstrained Optimization and Nonlinear Equations
- Numerical optimization
- Nonlinear programming: theory and algorithms
- Introductory Lectures on Convex Optimization: A Basic Course
- Introductory Lectures on Convex Optimization
- Trust Region Methods
- Nonlinear Programming
- Nonlinear Programming
- Computing a Trust Region Step