Back to search
University of British Columbia
Multiobjective Nelder-Mead algorithm using a mesh-map of weighted sums
Abstract
dc:descriptionAn algorithm for finding approximations to Pareto fronts in the optimization of multiple objective functions is presented. A mesh of weighted sums of the multiple objective functions serves as a model to approximate the Pareto front. The Nelder-Mead algorithm then solves these individual weighted sums without the use of derivatives. This multiobjective Nelder-Mead algorithm was found to be competitive with current algorithms on convex problems.
Degree
thesis:*- Name thesis:degree_name
- Master of Science - MSc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Computer Science
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 2020
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Nadeau, Patrick Charles
Rights
dc:rights- Statement dc:rights
-
- Attribution-NonCommercial-NoDerivatives 4.0 International
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/74776