PAINT-SiCon: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
Hartikainen, M., & Lovison, A. (2015). PAINT-SiCon: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization. Journal of Global Optimization, 62(2), 243-261. https://doi.org/10.1007/s10898-014-0232-9
Published in
Journal of Global OptimizationDate
2015Copyright
© Springer Science+Business Media New York 2014. This is a final draft version of an article whose final and definitive form has been published by Springer. Published in this repository with the kind permission of the publisher.
We introduce a novel approximation method for multiobjective optimization
problems called PAINT–SiCon. The method can construct consistent parametric
representations of Pareto sets, especially for nonconvex problems, by interpolating
between nondominated solutions of a given sampling both in the decision
and objective space. The proposed method is especially advantageous in computationally
expensive cases, since the parametric representation of the Pareto set can
be used as an inexpensive surrogate for the original problem during the decision
making process.
Publisher
Springer New York LLCISSN Search the Publication Forum
0925-5001Publication in research information system
https://converis.jyu.fi/converis/portal/detail/Publication/23808032
Metadata
Show full item recordCollections
Related items
Showing items with similar title or keywords.
-
Interactive Nonlinear Multiobjective Optimization Methods
Miettinen, Kaisa; Hakanen, Jussi; Podkopaev, Dmitry (Springer Science+Business Media, 2016)An overview of interactive methods for solving nonlinear multiobjective optimization problems is given. In interactive methods, the decision maker progressively provides preference information so that the most satisfactory ... -
Constructing a Pareto front approximation for decision making
Hartikainen, Markus; Miettinen, Kaisa; Wiecek, Margaret M. (SpringerLink, 2011)An approach to constructing a Pareto front approximation to computationally expensive multiobjective optimization problems is developed. The approximation is constructed as a sub-complex of a Delaunay triangulation of a ... -
Approximation method for computationally expensive nonconvex multiobjective optimization problems
Haanpää, Tomi (University of Jyväskylä, 2012) -
A New Hybrid Mutation Operator for Multiobjective Optimization with Differential Evolution
Sindhya, Karthik; Ruuska, Sauli; Haanpää, Tomi; Miettinen, Kaisa (Springer, 2011)Differential evolution has become one of the most widely used evolution- ary algorithms in multiobjective optimization. Its linear mutation operator is a sim- ple and powerful mechanism to generate trial vectors. However, ... -
Why Use Interactive Multi-Objective Optimization in Chemical Process Design?
Miettinen, Kaisa; Hakanen, Jussi (World Scientific, 2017)Problems in chemical engineering, like most real-world optimization problems, typically, have several conflicting performance criteria or objectives and they often are computationally demanding, which sets special requirements ...