Optimization Online


Worst-case Complexity Bounds of Directional Direct-search Methods for Multiobjective Optimization

A. L. Custódio (alcustodio***at***fct.unl.pt)
Y. Diouane (youssef.diouane***at***isae.fr)
R. Garmanjani (r.garmanjani***at***fct.unl.pt)
E. Riccietti (elisa.riccietti***at***enseeiht.fr)

Abstract: Direct Multisearch is a well-established class of algorithms, suited for multiobjective derivative-free optimization. In this work, we analyze the worst-case complexity of this class of methods in its most general formulation for unconstrained optimization. Considering nonconvex smooth functions, we show that to drive a given criticality measure below a specific positive threshold, Direct Multisearch takes at most a number of iterations proportional to the square of the inverse of the threshold, raised to the number of components of the objective function. This number is also proportional to the size of the set of linked sequences between the first unsuccessful iteration and the iteration immediately before the one where the criticality condition is satisfied. We then focus on a particular instance of Direct Multisearch, which considers a more strict criterion for accepting new nondominated points. In this case, we can establish a better worst-case complexity bound, simply proportional to the square of the inverse of the threshold, for driving the same criticality measure below the considered threshold.

Keywords: Multiobjective unconstrained optimization; Derivative-free optimization methods; Directional direct-search; Worst-case complexity; Nonconvex smooth optimization

Category 1: Nonlinear Optimization

Category 2: Nonlinear Optimization (Unconstrained Optimization )


Download: [PDF]

Entry Submitted: 09/19/2019
Entry Accepted: 09/19/2019
Entry Last Modified: 11/03/2020

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 Optimization Society