ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization
From MaRDI portal
Publication:4561237
DOI10.1137/16M1096505zbMath1409.90178WikidataQ109297719 ScholiaQ109297719MaRDI QIDQ4561237
Matthias Hwai Yong Tan, Alberto Lovison, Mohammad Tabatabaei, Markus E. Hartikainen, Kaisa M. Miettinen
Publication date: 5 December 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
decision makingsensitivity analysisPareto optimalitydimensionality reductionmetamodelingmultiple criteria optimization
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Decomposition and Coordination for Many-Objective Optimization ⋮ Conditional gradient method for multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global search perspectives for multiobjective optimization
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- Extracting optimal datasets for metamodelling and perspectives for incremental samplings
- Algebra of efficient sets for multiobjective complex systems
- Multiobjective optimization. Interactive and evolutionary approaches
- Epsilon efficiency
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Hierarchical multiobjective analysis for large-scale systems: Review and current status
- The jackknife estimate of variance
- Nonlinear multiobjective optimization
- Lipschitzian optimization without the Lipschitz constant
- On the number of criteria needed to decide Pareto optimality
- The design and analysis of computer experiments.
- Outcome space partition of the weight set in multiobjective linear programming
- Analysis of variance designs for model output
- \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
- Sequential Bayesian Polynomial Chaos Model Selection for Estimation of Sensitivity Indices
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Singular Continuation: Generating Piecewise Linear Approximations to Pareto Sets via Global Analysis
- Global Convergence of Radial Basis Function Trust Region Derivative-Free Algorithms
- Interactive Coordination of Objective Decompositions in Multiobjective Programming
- Semiconvex Regression for Metamodeling-Based Optimization
- Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms
- An Analysis for Unreplicated Fractional Factorials
- Solving multiple criteria problems by interactive decomposition
- Structure of Efficient Sets for Convex Objectives
- Modeling Interactions in Multidisciplinary Design: A Game Theoretic Approach
- Pareto reducible multicriteria optimization problems
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates
This page was built for publication: ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization