References
- Nesterov Yu. Introductory lectures on convex optimization. Applied Optimization. Dordrecht: Kluwer Academic Publishers; 2004.
- Gratton S, Sartenaer A, Toint PhL. Recursive trust-region methods for multiscale nonlinear optimization. SIAM J. Optim. 2008;19:414–444.
- Nesterov Yu, Polyak BT. Cubic regularization of Newton method and its global performance. Math. Prog. Ser. A. 2006;108:177–205.
- Cartis C, Gould NIM, Toint PhL. Adaptive cubic overestimation methods for unconstrained optimization. Part II: worst-case function-evaluation complexity. Math. Prog. Ser. A. 2011;130:295–319.
- Cartis C, Gould NIM, Toint PhL. An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity. IMA J. Numer. Anal. 2012;32:1662–1645.
- Cartis C, Gould NIM, Toint PhL. On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Prog. Ser. A. 2012 (online). doi: 10.1007/s10107-012-0617-9.
- Cartis C, Gould NIM, Toint PhL. On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming. SIAM J. Optim. 2011;21:1721–1739.
- Ortega JM, Rheinboldt WC. Iterative solution of nonlinear equations in several variables. London: Academic Press; 1970.
- Nocedal J, Wright SJ. Numerical optimization. Series in operations research. Heidelberg: Springer Verlag; 1999.
- Grippo L, Lampariello F, Lucidi S. A nonmonotone line search technique for Newton’s method. SIAM J. Numer. Anal. 1986;23:707–716.
- Grippo L, Lampariello F, Lucidi S. A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 1989;60:401–419.
- Toint PhL. An assessment of non-monotone linesearch techniques for unconstrained optimization. SIAM J. Sci. Stat. Comp. 1996;17:725–739.
- Bertsekas DP. Nonlinear Programming. Belmont (MA): Athena Scientific; 2008.
- Cartis C, Gould NIM, Toint PhL. On the complexity of steepest descent, Newton’s and regularized Newton’s methods for nonconvex unconstrained optimization. SIAM J. Optim. 2010;20:2833–2852.
- Cartis C, Gould NIM, Toint PhL. On the complexity of the steepest-descent with exact linesearches. Technical Report naXys-16-2012, Namur Centre for Complex Systems (naXys). Belgium: FUNDP-University of Namur, Namur; 2012.