Worst case complexity of direct search

EURO Journal on Computational Optimization

Volumn 1, Issue 1-2, 2013, Pages 143-153

  Vicente, L N ^a  

^a CMUCUniversity of Coimbra   (Portugal)

Author keywords

Derivative free optimization; Direct search; Sufficient decrease; Worst case complexity

Indexed keywords

EID: 85130190749     PISSN: 21924406     EISSN: 21924414     Source Type: Journal    
DOI: 10.1007/s13675-012-0003-7     Document Type: Article

References (18)

1. Audet, C., Dennis, J.E. Jr, Analysis of generalized pattern searches. SIAM J Optim 13 (2002), 889–903 10.1137/S1052623400378742.
2. Audet, C., Dennis, J.E., Mesh adaptive direct search algorithms for constrained optimization. SIAM J Optim 17 (2006), 188–217.
3. Cartis, C., Gould, N.I.M., Toint, PhL, Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math Program 130 (2011), 295–319 10.1007/s10107-009-0337-y.
4. Cartis, C., Gould, N.I.M., Toint, PhL, On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization. SIAM J Optim 20 (2010), 2833–2852 10.1137/090774100.
5. Cartis, C., Gould, N.I.M., Toint, PhL, On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization. SIAM J Optim 22 (2012), 66–86 10.1137/100812276.
6. Conn AR, Gould NIM, Toint PhL (2000) Trust-region methods. MPS-SIAM Series on Optimization. SIAM, Philadelphia.
7. Conn AR, Scheinberg K, Vicente LN (2009) Introduction to derivative-free optimization. MPS-SIAM Series on Optimization. SIAM, Philadelphia.
8. Dolan, E.D., Lewis, R.M., Torczon, V., On the local convergence of pattern search. SIAM J Optim 14 (2003), 567–583 10.1137/S1052623400374495.
9. Garmanjani R, Vicente LN (2012) Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization. IMA J Numer Anal (to appear).
10. Gratton, S., Mouffe, M., Toint, PhL, Weber-Mendonca, M., A recursive trust-region method in infinity norm for bound-constrained nonlinear optimization. IMA J Numer Anal 28 (2008), 827–861 10.1093/imanum/drn034.
11. Gratton, S., Sartenaer, A., Toint, PhL, Recursive trust-region methods for multiscale nonlinear optimization. SIAM J Optim 19 (2008), 414–444 10.1137/050623012.
12. Jarre F (2012) On Nesterov's smooth Chebyshev–Rosenbrock function. Optim Methods Softw (to appear).
13. Kolda, T.G., Lewis, R.M., Torczon, V., Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev 45 (2003), 385–482 10.1137/S003614450242889.
14. Lewis, R.M., Torczon, V., Pattern search methods for linearly constrained minimization. SIAM J Optim 10 (2000), 917–941 10.1137/S1052623497331373.
15. Nesterov, Yu, Introductory lectures on convex optimization, 2004, Kluwer, Dordrecht.
16. Nesterov, Yu, Polyak, B.T., Cubic regularization of Newton's method and its global performance. Math Program 108 (2006), 177–205 10.1007/s10107-006-0706-8.
17. Torczon, V., On the convergence of pattern search algorithms. SIAM J Optim 7 (1997), 1–25 10.1137/S1052623493250780.
18. Vicente, L.N., Custódio, A.L., Analysis of direct searches for discontinuous functions. Math Program 133 (2012), 299–325 10.1007/s10107-010-0429-8.