Multiobjective Nelder-Mead algorithm using a mesh-map of weighted sums
department or school: Arts and Sciences, Irving K. Barber School of (Okanagan)
department or school: Computer Science, Mathematics, Physics and Statistics, Department of (Okanagan)
data provider: DSpace
degree campus: UBCO
creator: Nadeau, Patrick Charles
issued: 2020-06-23T22:34:17Z
issued: 2020
related degree: Master of Science - MSc
degree grantor: University of British Columbia
description: An 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.
aggregated CHO: https://circle.library.ubc.ca/rest/handle/2429/74776
note: Multiobjective Nelder-MeadAlgorithm Using a Mesh-Map ofWeighted SumsbyPatrick Charles NadeauB.Mat. Hons., Carleton University, 2009A THESIS SUBMITTED IN PARTIAL FULFILLMENT OFTHE REQUIREMENTS FOR THE DEGREE OFMASTER OF SCIENCEinTHE COLLEGE OF GRADUATE STUDIES(Computer Science)THE UNIVERSITY OF BRITISH COLUMBIA(Okanagan)June 2020© Patrick Charles Nadeau, 2020The following individuals certify that they have read, and recommendto the College of Graduate Studies for acceptance, a thesis/dissertation en-titled:Multiobjective Nelder-Mead Algorithm Using a Mesh-Map of Weighted Sumssubmitted by Patrick Charles Nadeau in partial fulfilment of the re-quirements of the degree of Master of ScienceWarren Hare, Irving K. Barber School of Arts and SciencesSupervisorWayne Broughton, Irving K. Barber School of Arts and SciencesSupervisory Committee MemberApurva Narayan, Irving K. Barber School of Arts and SciencesSupervisory Committee MemberAbbas Milani, School of EngineeringUniversity ExamineriiAbstractAn algorithm for finding approximations to Pareto fronts in the opti-mization of multiple objective functions is presented. A mesh of weightedsums of the multiple objective functions serves as a model to approximatethe Pareto front. The Nelder-Mead algorithm then solves these individualweighted sums without the use of derivatives. This multiobjective Nelder-Mead algorithm was found to be competitive with current algorithms onconvex problems.iiiLay SummaryThis work tries to get to the bottom of many things at once using trian-gles.ivTable of ContentsAbstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iiiLay Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ivTable of Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . vList of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viiList of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viiiAcknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . .…
has type: Thesis/Dissertation
date issued: 2020-09
is shown at: 10.14288/1.0391980
language: eng
degree discipline: Computer Science
provider: Vancouver : University of British Columbia Library
publisher: University of British Columbia
rights: Attribution-NonCommercial-NoDerivatives 4.0 International
rights URI: http://creativecommons.org/licenses/by-nc-nd/4.0/
scholar level: Graduate
type: Text
identifier URI: http://hdl.handle.net/2429/74776