Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results.
An Adaptive Regularisation algorithm using Cubics (ARC) is proposed for unconstrained optimization, generalizing at the same time an unpublished method due to Griewank (Technical Report NA/12, 1981, DAMTP, University of Cambridge), an algorithm by Nesterov and Polyak (Math Program 108(1):177-205, 20...
मुख्य लेखकों: | Cartis, C, Gould, N, Toint, P |
---|---|
स्वरूप: | Journal article |
भाषा: | English |
प्रकाशित: |
2011
|
समान संसाधन
-
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity.
द्वारा: Cartis, C, और अन्य
प्रकाशित: (2011) -
Adaptive cubic overestimation methods for unconstrained optimization
द्वारा: Cartis, C, और अन्य
प्रकाशित: (2007) -
Adaptive cubic overestimation methods for unconstrained optimization
द्वारा: Cartis, C, और अन्य
प्रकाशित: (2007) -
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization.
द्वारा: Cartis, C, और अन्य
प्रकाशित: (2012) -
Complexity bounds for second-order optimality in unconstrained optimization.
द्वारा: Cartis, C, और अन्य
प्रकाशित: (2012)