Skip to Main content Skip to Navigation
Journal articles

Worst-Case Complexity Bounds of Directional Direct-Search Methods for Multiobjective Optimization

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.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03040932
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Friday, December 4, 2020 - 4:14:18 PM
Last modification on : Thursday, March 18, 2021 - 2:29:26 PM
Long-term archiving on: : Friday, March 5, 2021 - 7:21:40 PM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2021-05-23

Please log in to resquest access to the document

Identifiers

Citation

Ana Luísa Custódio, Youssef Diouane, Rohollah Garmanjani, Elisa Riccietti. Worst-Case Complexity Bounds of Directional Direct-Search Methods for Multiobjective Optimization. Journal of Optimization Theory and Applications, Springer Verlag, 2020, pp.0. ⟨10.1007/s10957-020-01781-z⟩. ⟨hal-03040932⟩

Share

Metrics

Record views

61