Pareto-aware strategies for faster convergence in multi-objective multi-scale search optimization
From MaRDI portal
Publication:2195291
Recommendations
- MultiGLODS: global and local multiobjective optimization using direct search
- Dynamic algorithm selection for Pareto optimal set approximation
- On the extension of the \textsc{direct} algorithm to multiple objectives
- A mesh adaptive direct search algorithm for multiobjective optimization
- Direct Multisearch for Multiobjective Optimization
Cites work
- A naive multi-scale search algorithm for global optimization problems
- A stopping criterion for multi-objective optimization evolutionary algorithms
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Direct Multisearch for Multiobjective Optimization
- Hypervolume-based multiobjective optimization: theoretical foundations and practical implications
- Lipschitzian optimization without the Lipschitz constant
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- MSO: a framework for bound-constrained black-box global optimization algorithms
- Multi-objective simultaneous optimistic optimization
- MultiGLODS: global and local multiobjective optimization using direct search
- SMS-EMOA: multiobjective selection based on dominated hypervolume
Cited in
(3)
This page was built for publication: Pareto-aware strategies for faster convergence in multi-objective multi-scale search optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2195291)