On the extension of the \textsc{direct} algorithm to multiple objectives
type: Item
instance of: scholarly article
title: On the extension of the \textsc{direct} algorithm to multiple objectives
zbMATH Open document ID: 1465.90094
author: Alberto Lovison
author: Kaisa Miettinen
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7340750
zbMATH Keywords: global convergence
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: multiple criteria optimization
zbMATH Keywords: \textsc{direct} algorithm
zbMATH Keywords: deterministic optimization algorithms
cites work: MultiGLODS
cites work: ParEGO
cites work: An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined Manifold
cites work: A mesh adaptive direct search algorithm for multiobjective optimization
cites work: A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
cites work: Direct Multisearch for Multiobjective Optimization
cites work: GLODS: global and local optimization using direct search
cites work: MultiGLODS: global and local multiobjective optimization using direct search
cites work: Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
cites work: Multi-objective optimization using evolutionary algorithms
cites work: Covering Pareto sets by multilevel subdivision techniques
cites work: Evolutionary Multi-Criterion Optimization
cites work: Q3743133
cites work: A deterministic algorithm for global multi-objective optimization
cites work: Efficient multicriterial optimization based on intensive reuse of search information
cites work: Q4134602
cites work: PAINT: Pareto front interpolation for nonlinear multiobjective optimization
cites work: \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: GOSH: derivative-free global optimization using multi-dimensional space-filling curves
cites work: Singular Continuation: Generating Piecewise Linear Approximations to Pareto Sets via Global Analysis
cites work: Global search perspectives for multiobjective optimization
cites work: On the structure of the pareto set of generic mappings
cites work: Nonlinear multiobjective optimization
cites work: Complete search in continuous global optimization and constraint satisfaction
cites work: Non-convex multi-objective optimization
cites work: An algorithm for finding the absolute extremum of a function
cites work: Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
cites work: On convergence of "divide the best" global optimization algorithms
cites work: A Sequential Method Seeking the Global Maximum of a Function
cites work: Q5686695
cites work: Global optimization requires global information
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
cites work: A mathematical basis for satisficing decision making
cites work: On the completeness and constructiveness of parametric characterizations to vector optimization problems
cites work: A one-step worst-case optimal algorithm for bi-objective univariate optimization
cites work: On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
describes a project that uses: MultiGLODS
describes a project that uses: ParEGO
describes a project that uses: NBI
describes a project that uses: PAINT
describes a project that uses: MODIR
MaRDI profile type: Publication
full work available at URL: s10898-020-00942-8
OpenAlex ID: W3083710052
Wikidata QID: Q109285215
DOI: 10.1007/S10898-020-00942-8
description: scientific article; zbMATH DE number 7340750