References
- Nesterov Y. Introductory lectures on convex optimization. Dordrecht: Kluwer Academic Publishers; 2004.
- Cartis C, Gould NIM, Toint Ph. L. Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function-evaluation complexity. Math Program. 2011;130:295–319. doi: https://doi.org/10.1007/s10107-009-0337-y
- Vicente LN. Worst case complexity of direct search. EURO J Comput Optim. 2013;1:143–153. doi: https://doi.org/10.1007/s13675-012-0003-7
- Gratton S, Royer CW, Vicente LN, et al. Direct search based on probabilistic descent. SIAM J Optim. 2015;25:1515–1541. doi: https://doi.org/10.1137/140961602
- Konecny J, Richtárik P. Simple complexity analysis of direct search. Technical report. 2014.
- Nesterov Y, Polyak B. Cubic regularization of Newton's method and its global performance. Math Program. 2006;108:177–205. doi: https://doi.org/10.1007/s10107-006-0706-8
- Cartis C, Gould NIM, Toint Ph. L. On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization. SIAM J Optim. 2012;22:66–86. doi: https://doi.org/10.1137/100812276
- Curtis FE, Robinson PD, Samadi M. A trust region algorithm with a worst-case iteration complexity of for O(ϵ−3/2) nonconvex optimization. Math Program. 2017;162(1–2):1–32. doi: https://doi.org/10.1007/s10107-016-1026-2
- Martínez JM, Raydan M. Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization. J Global Optim. 2017;68(2):367–385. doi: https://doi.org/10.1007/s10898-016-0475-8
- Birgin EG, Martínez JM. The use of quadratic regularization with a cubic descent condition for unconstrained optimization. SIAM J Optim. 2017;27(2):1049–1074. doi: https://doi.org/10.1137/16M110280X
- Nesterov Y. How to make the gradients small. Optima. 2012;88:10–11.
- Dodangeh M, Vicente LN. Worst case complexity for direct search under convexity. Math Program. 2016;155:307–332. doi: https://doi.org/10.1007/s10107-014-0847-0
- Gratton S, Sartenaer A, Toint Ph. L. Recursive trust-region methods for multiscale nonlinear optimization. SIAM J Optim. 2008;19:414–444. doi: https://doi.org/10.1137/050623012
- Garmanjani R, Júdice D, Vicente LN. Trust-region methods without using derivatives: worst case complexity and the non-smooth case. SIAM J Optim. 2016;26:1987–2011. doi: https://doi.org/10.1137/151005683
- Garmanjani R, Vicente LN. Smoothing and worst case complexity for direct-search methods in non-smooth optimization. IMA J Numer Anal. 2013;33:1008–1028. doi: https://doi.org/10.1093/imanum/drs027
- Bian W, Chen X. Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization. SIAM J Optim. 2013;23:1718–1741. doi: https://doi.org/10.1137/120864908
- Cartis C, Gould NIM, Toint Ph. L. Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. Optim Methods Softw. 2012;27:197–219. doi: https://doi.org/10.1080/10556788.2011.602076
- Grapiglia GN, Yuan J, Yuan Y. On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization. Optim Methods Softw. 2016;31:591–604. doi: https://doi.org/10.1080/10556788.2015.1130129
- Toint Ph. L. Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization. Optim Methods Softw. 2013;28:82–95. doi: https://doi.org/10.1080/10556788.2011.610458
- Conn AR, Gould NIM, Toint Ph. L. Trust-region methods. Philadelphia (PA): SIAM; 2000 (MPS-SIAM Series on Optimization).