- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Multiobjective Nelder-Mead algorithm using a mesh-map...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Multiobjective Nelder-Mead algorithm using a mesh-map of weighted sums Nadeau, Patrick Charles
Abstract
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.
Item Metadata
| Title |
Multiobjective Nelder-Mead algorithm using a mesh-map of weighted sums
|
| Creator | |
| Publisher |
University of British Columbia
|
| Date Issued |
2020
|
| 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.
|
| Genre | |
| Type | |
| Language |
eng
|
| Date Available |
2020-06-23
|
| Provider |
Vancouver : University of British Columbia Library
|
| Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
| DOI |
10.14288/1.0391980
|
| URI | |
| Degree (Theses) | |
| Program (Theses) | |
| Affiliation | |
| Degree Grantor |
University of British Columbia
|
| Graduation Date |
2020-09
|
| Campus | |
| Scholarly Level |
Graduate
|
| Rights URI | |
| Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International