Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization.
The adaptive cubic regularization algorithms described in Cartis, Gould and Toint [Adaptive cubic regularisation methods for unconstrained optimization Part II: Worst-case function- and derivative-evaluation complexity, Math. Program. (2010), doi:10.1007/s10107-009-0337-y (online)]; [Part I: Motivat...
Huvudupphovsmän: | Cartis, C, Gould, N, Toint, P |
---|---|
Materialtyp: | Journal article |
Språk: | English |
Publicerad: |
2012
|
Liknande verk
Liknande verk
-
Adaptive cubic overestimation methods for unconstrained optimization
av: Cartis, C, et al.
Publicerad: (2007) -
Adaptive cubic overestimation methods for unconstrained optimization
av: Cartis, C, et al.
Publicerad: (2007) -
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
av: Cartis, C, et al.
Publicerad: (2012) -
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity.
av: Cartis, C, et al.
Publicerad: (2011) -
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results.
av: Cartis, C, et al.
Publicerad: (2011)