Worst case complexity of direct search

@article{Vicente2013WorstCC,
  title={Worst case complexity of direct search},
  author={L. N. Vicente},
  journal={EURO J. Computational Optimization},
  year={2013},
  volume={1},
  pages={143-153}
}
In this paper we prove that direct search of directional type shares the worst case complexity bound of steepest descent when sufficient decrease is imposed using a quadratic function of the step size parameter. This result is proved under smoothness of the objective function and using a framework of the type of GSS (generating set search). We also discuss the worst case complexity of direct search when only simple decrease is imposed and when the objective function is nonsmooth. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
28 Extracted Citations
13 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 28 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 13 references

Introduction to Derivative-Free Optimization

  • A. R. Conn, K. Scheinberg, L. N. Vicente
  • MPS-SIAM Series on Optimization. SIAM…
  • 2009

Introductory Lectures on Convex Optimization

  • Yu. Nesterov
  • Kluwer Academic Publishers, Dordrecht,
  • 2004

Similar Papers

Loading similar papers…