Optimization Online


Worst Case Complexity of Direct Search

L. N. Vicente(lnv***at***mat.uc.pt)

Abstract: 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 non-smooth.

Keywords: derivative-free optimization, direct search, worst case complexity, sufficient decrease

Category 1: Nonlinear Optimization

Citation: L. N. Vicente, Worst case complexity of direct search, preprint 10-17, Dept. of Mathematics, Univ. Coimbra, 2010.

Download: [PDF]

Entry Submitted: 06/01/2010
Entry Accepted: 06/01/2010
Entry Last Modified: 06/01/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society