Worst case complexity of direct search
Author:
- 1 May 2013
- journal article
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 1 (1-2) , 143-153
Abstract
No abstract availableFunding Information
- Courant Institute of Mathematical Sciences, New York University
- Fundação Luso-Americana para o Desenvolvimento
- Fuel Cell Technologies Program (PTDC/MAT/098214/2008)
This publication has 17 references indexed in Scilit:
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimizationIMA Journal of Numerical Analysis, 2012
- On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex MinimizationSIAM Journal on Optimization, 2012
- Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexityMathematical Programming, 2010
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization ProblemsSIAM Journal on Optimization, 2010
- Introduction to Derivative-Free Optimization2009
- A recursive Formula-trust-region method for bound-constrained nonlinear optimizationIMA Journal of Numerical Analysis, 2008
- Recursive Trust-Region Methods for Multiscale Nonlinear OptimizationSIAM Journal on Optimization, 2008
- Mesh Adaptive Direct Search Algorithms for Constrained OptimizationSIAM Journal on Optimization, 2006
- On the Local Convergence of Pattern SearchSIAM Journal on Optimization, 2003
- Analysis of Generalized Pattern SearchesSIAM Journal on Optimization, 2002