Efficient multicriterial optimization based on intensive reuse of search information
From MaRDI portal
Publication:1754449
DOI10.1007/s10898-018-0624-3zbMath1402.90166OpenAlexW2791927519MaRDI QIDQ1754449
Evgeniy Kozinov, Victor P. Gergel
Publication date: 30 May 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0624-3
computational complexitydecision makingscalarizationmulticriterial optimizationdimensionality reductionglobal optimization algorithmsearch information
Related Items (5)
Integrating \(\varepsilon \)-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems ⋮ A hybrid of Bayesian-based global search with Hooke–Jeeves local refinement for multi-objective optimization problems ⋮ Computationally efficient approach for solving lexicographic multicriteria optimization problems ⋮ On the extension of the \textsc{direct} algorithm to multiple objectives ⋮ An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel global optimization on GPU
- Adaptive nested optimization scheme for multidimensional global search
- Survey of multi-objective optimization methods for engineering
- Comparison of multi-objective optimization methodologies for engineering applications
- Scalarizations for adaptively solving multi-objective optimization problems
- Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- Multiobjective optimization. Interactive and evolutionary approaches
- Nonlinear multiobjective optimization
- A parallel method for finding the global minimum of univariate functions
- Parallel characteristical algorithms for solving problems of global optimization
- Local tuning and partition strategies for diagonal GO methods
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- Multiple criteria decision analysis. State of the art surveys
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Non-convex multi-objective optimization
- Stochastic global optimization.
- A survey of recent developments in multiobjective optimization
- Multiobjective evolutionary algorithms and applications.
- Multiobjective optimization: survey of methods and industrial applications
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Simplicial Global Optimization
- Multiobjective Optimization
- Multicriteria Optimization
- Algorithm 829
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global optimization
- A locally-biased form of the DIRECT algorithm.
This page was built for publication: Efficient multicriterial optimization based on intensive reuse of search information
