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...
Główni autorzy: | Cartis, C, Gould, N, Toint, P |
---|---|
Format: | Journal article |
Język: | English |
Wydane: |
2012
|
Podobne zapisy
-
Adaptive cubic overestimation methods for unconstrained optimization
od: Cartis, C, i wsp.
Wydane: (2007) -
Adaptive cubic overestimation methods for unconstrained optimization
od: Cartis, C, i wsp.
Wydane: (2007) -
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
od: Cartis, C, i wsp.
Wydane: (2012) -
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity.
od: Cartis, C, i wsp.
Wydane: (2011) -
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results.
od: Cartis, C, i wsp.
Wydane: (2011)