ANOVA-MOP: ANOVA decomposition for multiobjective optimization

DOI10.1137/16M1096505zbMATH Open1409.90178WikidataQ109297719 ScholiaQ109297719MaRDI QIDQ4561237FDOQ4561237

Authors: Mohammad Tabatabaei, Alberto Lovison, Matthias Hwai Yong Tan, Markus E. Hartikainen, Kaisa Miettinen 

Publication date: 5 December 2018

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 50421
• Multiobjective optimization of expensive-to-evaluate deterministic computer simulator models
• Global Sensitivity Analysis for Optimization with Variable Selection
• Towards `\(h\)-\(p\) \textit{adaptive}' generalized ANOVA
• Anchor points matter in ANOVA decomposition

zbMATH Keywords

decision makingsensitivity analysisdimensionality reductionmetamodelingPareto optimalitymultiple criteria optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• The design and analysis of computer experiments.
• The jackknife estimate of variance
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Title not available (Why is that?)
• Analysis of variance designs for model output
• Title not available (Why is that?)
• Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates
• An Analysis for Unreplicated Fractional Factorials
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• Nonlinear multiobjective optimization
• Lipschitzian optimization without the Lipschitz constant
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pareto reducible multicriteria optimization problems
• Multiobjective optimization. Interactive and evolutionary approaches
• Epsilon efficiency
• Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
• Interactive Coordination of Objective Decompositions in Multiobjective Programming
• Reducing the number of function evaluations in mesh adaptive direct search algorithms
• Algebra of efficient sets for multiobjective complex systems
• Hierarchical multiobjective analysis for large-scale systems: Review and current status
• Outcome space partition of the weight set in multiobjective linear programming
• Title not available (Why is that?)
• Singular continuation: generating piecewise linear approximations to Pareto sets via global analysis
• Adaptive sampling with a Lipschitz criterion for accurate metamodeling
• Global search perspectives for multiobjective optimization
• Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
• Global convergence of radial basis function trust region derivative-free algorithms
• Solving multiple criteria problems by interactive decomposition
• On the number of criteria needed to decide Pareto optimality
• Extracting optimal datasets for metamodelling and perspectives for incremental samplings
• Structure of Efficient Sets for Convex Objectives
• \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
• Modeling Interactions in Multidisciplinary Design: A Game Theoretic Approach
• Sequential Bayesian polynomial chaos model selection for estimation of sensitivity indices
• Semiconvex regression for metamodeling-based optimization

Cited In (2)

• Conditional gradient method for multiobjective optimization
• Decomposition and coordination for many-objective optimization

This page was built for publication: ANOVA-MOP: ANOVA decomposition for multiobjective optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4561237)