| dc.creator |
Chang, Tyler |
|
| dc.creator |
Watson, Layne |
|
| dc.creator |
Larson, Jeffrey |
|
| dc.creator |
Neveu, Nicole |
|
| dc.creator |
Thacker, William |
|
| dc.creator |
Deshpande, Shubhangi |
|
| dc.creator |
Lux, Thomas |
|
| dc.date |
2022-10-03T16:34:29Z |
|
| dc.date |
2022-10-03T16:34:29Z |
|
| dc.date |
2022-09-10 |
|
| dc.date |
2022-09-30T20:25:56Z |
|
| dc.date.accessioned |
2023-02-28T17:40:31Z |
|
| dc.date.available |
2023-02-28T17:40:31Z |
|
| dc.identifier |
http://hdl.handle.net/10919/112052 |
|
| dc.identifier |
https://doi.org/10.1145/3529258 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/266619 |
|
| dc.description |
VTMOP is a Fortran 2008 software package containing two Fortran modules for solving computationally expensive bound-constrained blackbox multiobjective optimization problems. VTMOP implements the algorithm of Deshpande et al. [2016], which handles two or more objectives, does not require any derivatives, and produces well-distributed points over the Pareto front. The first module contains a general framework for solving multiobjective optimization problems by combining response surface methodology, trust region methodology, and an adaptive weighting scheme. The second module features a driver subroutine that implements this framework when the objective functions can be wrapped as a Fortran subroutine. Support is provided for both serial and parallel execution paradigms, and VTMOP is demonstrated on several test problems as well as one real-world problem in the area of particle accelerator optimization. |
|
| dc.description |
Published version |
|
| dc.format |
application/pdf |
|
| dc.format |
application/pdf |
|
| dc.language |
en |
|
| dc.publisher |
ACM |
|
| dc.rights |
Public Domain (U.S.) |
|
| dc.rights |
http://creativecommons.org/publicdomain/mark/1.0/ |
|
| dc.title |
Algorithm 1028: VTMOP: Solver for Blackbox Multiobjective Optimization Problems |
|
| dc.type |
Article - Refereed |
|
| dc.type |
Text |
|