Worst-Case Complexity Bounds of Directional Direct-Search Methods for Multiobjective Optimization
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Optimization Theory and Applications"
DOI: 10.1007/s10957-020-01781-z
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… read more here.
Keywords: direct multisearch; case; case complexity; optimization ... See more keywords
Using first-order information in direct multisearch for multiobjective optimization
Sign Up to like & getrecommendations! Published in 2022 at "Optimization Methods and Software"
DOI: 10.1080/10556788.2022.2060971
Abstract: Derivatives are an important tool for single-objective optimization. In fact, it is commonly accepted that derivative-based methods present a better performance than derivative-free optimization approaches. In this work, we will show that the same does… read more here.
Keywords: order information; multiobjective optimization; direct multisearch; derivative based ... See more keywords