On the extension of the \textsc{direct} algorithm to multiple objectives
From MaRDI portal
Publication:2022240
DOI10.1007/s10898-020-00942-8zbMath1465.90094OpenAlexW3083710052WikidataQ109285215 ScholiaQ109285215MaRDI QIDQ2022240
Alberto Lovison, Kaisa M. Miettinen
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00942-8
global convergencemultiobjective optimizationmultiple criteria optimization\textsc{direct} algorithmdeterministic optimization algorithms
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)
Related Items
Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach ⋮ Preface to the special issue dedicated to the 14th international workshop on global optimization held in Leiden, the Netherlands, September 18--21, 2018
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ParEGO
- Global search perspectives for multiobjective optimization
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- PAINT: Pareto front interpolation for nonlinear multiobjective optimization
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Global optimization requires global information
- Nonlinear multiobjective optimization
- Lipschitzian optimization without the Lipschitz constant
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Efficient multicriterial optimization based on intensive reuse of search information
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- MultiGLODS: global and local multiobjective optimization using direct search
- Covering Pareto sets by multilevel subdivision techniques
- A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
- A mesh adaptive direct search algorithm for multiobjective optimization
- \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
- GLODS: global and local optimization using direct search
- Non-convex multi-objective optimization
- A deterministic algorithm for global multi-objective optimization
- On the structure of the pareto set of generic mappings
- Singular Continuation: Generating Piecewise Linear Approximations to Pareto Sets via Global Analysis
- Direct Multisearch for Multiobjective Optimization
- A mathematical basis for satisficing decision making
- An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined Manifold
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- An algorithm for finding the absolute extremum of a function
- On convergence of "divide the best" global optimization algorithms
- Complete search in continuous global optimization and constraint satisfaction
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A Sequential Method Seeking the Global Maximum of a Function
- Evolutionary Multi-Criterion Optimization
- MultiGLODS
