On the Extension of the DIRECT Algorithm to Multiple Objectives
Lovison, A., & Miettinen, K. (2021). On the Extension of the DIRECT Algorithm to Multiple Objectives. Journal of Global Optimization, 79(2), 387-412. https://doi.org/10.1007/s10898-020-00942-8
Published inJournal of Global Optimization
© The Author(s) 2020
Deterministic global optimization algorithms like Piyavskii–Shubert, DIRECT, EGO and many more, have a recognized standing, for problems with many local optima. Although many single objective optimization algorithms have been extended to multiple objectives, completely deterministic algorithms for nonlinear problems with guarantees of convergence to global Pareto optimality are still missing. For instance, deterministic algorithms usually make use of some form of scalarization, which may lead to incomplete representations of the Pareto optimal set. Thus, all global Pareto optima may not be obtained, especially in nonconvex cases. On the other hand, algorithms attempting to produce representations of the globally Pareto optimal set are usually based on heuristics. We analyze the concept of global convergence for multiobjective optimization algorithms and propose a convergence criterion based on the Hausdorff distance in the decision space. Under this light, we consider the well-known global optimization algorithm DIRECT, analyze the available algorithms in the literature that extend DIRECT to multiple objectives and discuss possible alternatives. In particular, we propose a novel definition for the notion of potential Pareto optimality extending the notion of potential optimality defined in DIRECT. We also discuss its advantages and disadvantages when compared with algorithms existing in the literature. ...
PublisherSpringer Science and Business Media LLC
Publication in research information system
MetadataShow full item record
Related funder(s)Academy of Finland
Funding program(s)Academy Project, AoF
Additional information about fundingOpen access funding provided by Universitá degli Studi di Padova within the CRUI-CARE Agreement.
Showing items with similar title or keywords.
Lovison, Alberto; Miettinen, Kaisa (American Institute of Physics, 2019)The direct algorithm has been recognized as an efficient global optimization method which has few requirements of regularity and has proven to be globally convergent in general cases. direct has been an inspiration or has ...
Sindhya, Karthik (University of Jyväskylä, 2011)
LR-NIMBUS : an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions Koushki, Javad; Miettinen, Kaisa; Soleimani-damaneh, Majid (Springer Science and Business Media LLC, 2022)In this paper, we develop an interactive algorithm to support a decision maker to find a most preferred lightly robust efficient solution when solving uncertain multiobjective optimization problems. It extends the interactive ...
Saini, Bhupinder Singh; Hakanen, Jussi; Miettinen, Kaisa (Springer, 2020)Over the years, scalarization functions have been used to solve multiobjective optimization problems by converting them to one or more single objective optimization problem(s). This study proposes a novel idea of solving ...
Misitano, Giovanni; Saini, Bhupinder Singh; Afsar, Bekir; Shavazipour, Babooshka; Miettinen Kaisa (Institute of Electrical and Electronics Engineers (IEEE), 2021)Interactive multiobjective optimization methods incorporate preferences from a human decision maker in the optimization process iteratively. This allows the decision maker to focus on a subset of solutions, learn about the ...