Approximation through interpolation in nonconvex multiobjective optimization
Published inJyväskylä studies in computing
PublisherUniversity of Jyväskylä
MetadataShow full item record
- Väitöskirjat 
Showing items with similar title or keywords.
Haanpää, Tomi (University of Jyväskylä, 2012)
On solving computationally expensive multiobjective optimization problems with interactive methods Ojalehto, Vesa (University of Jyväskylä, 2014)
Chugh, Tinkle (University of Jyväskylä, 2017)Multiobjective optimization problems (MOPs) with a large number of conﬂicting objectives are often encountered in industry. Moreover, these problem typically involve expensive evaluations (e.g. time consuming simulations ...
A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms Chugh, Tinkle; Sindhya, Karthik; Hakanen, Jussi; Miettinen, Kaisa (Springer, 2019)Evolutionary algorithms are widely used for solving multiobjective optimization problems but are often criticized because of a large number of function evaluations needed. Approximations, especially function approximations, ...
Misitano, Giovanni; Saini, Bhupinder Singh; Afsar, Bekir; Shavazipour, Babooshka; Miettinen Kaisa (Institute of Electrical and Electronics Engineers (IEEE), 2021)Interactive multiobjective optimization methods incorporate preferences from a human decision maker in the optimization process iteratively. This allows the decision maker to focus on a subset of solutions, learn about the ...