On the extension of the \textsc{direct} algorithm to multiple objectives
From MaRDI portal
Publication:2022240
Recommendations
Cites work
- \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
- A deterministic algorithm for global multi-objective optimization
- A mathematical basis for satisficing decision making
- A mesh adaptive direct search algorithm for multiobjective optimization
- A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- A Sequential Method Seeking the Global Maximum of a Function
- An algorithm for finding the absolute extremum of a function
- An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined Manifold
- Complete search in continuous global optimization and constraint satisfaction
- Covering Pareto sets by multilevel subdivision techniques
- Direct Multisearch for Multiobjective Optimization
- Efficient multicriterial optimization based on intensive reuse of search information
- Evolutionary Multi-Criterion Optimization
- Global optimization requires global information
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global search perspectives for multiobjective optimization
- GLODS: global and local optimization using direct search
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- scientific article; zbMATH DE number 3978850 (Why is no real title available?)
- scientific article; zbMATH DE number 3562121 (Why is no real title available?)
- scientific article; zbMATH DE number 3424863 (Why is no real title available?)
- Lipschitzian optimization without the Lipschitz constant
- Multi-objective optimization using evolutionary algorithms
- MultiGLODS
- MultiGLODS: global and local multiobjective optimization using direct search
- Non-convex multi-objective optimization
- Nonlinear multiobjective optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On convergence of "divide the best" global optimization algorithms
- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- On the structure of the pareto set of generic mappings
- PAINT: Pareto front interpolation for nonlinear multiobjective optimization
- ParEGO
- Singular continuation: generating piecewise linear approximations to Pareto sets via global analysis
Cited in
(11)- MultiGLODS: global and local multiobjective optimization using direct search
- Preface to the special issue dedicated to the 14th international workshop on global optimization held in Leiden, the Netherlands, September 18--21, 2018
- On the use of polynomial models in multiobjective directional direct search
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
- Pareto-aware strategies for faster convergence in multi-objective multi-scale search optimization
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- Multiobjective interacting particle algorithm for global optimization
- Direct Multisearch for Multiobjective Optimization
- Global search perspectives for multiobjective optimization
- Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach
- Multiobjective optimization by using cutting angle methods and hypervolume criterion
This page was built for publication: On the extension of the \textsc{direct} algorithm to multiple objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022240)
