Revisiting norm optimization for multi-objective black-box problems : a finite-time analysis
The complexity of Pareto fronts imposes a great challenge on the convergence analysis of multi-objective optimization methods. While most theoretical convergence studies have addressed finite-set and/or discrete problems, others have provided probabilistic guarantees, assumed a total order on the so...
Main Authors: | Al-Dujaili, Abdullah, Suresh, Sundaram |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/143267 |
Similar Items
-
A Kriging-Assisted Multi-Objective Constrained Global Optimization Method for Expensive Black-Box Functions
by: Yaohui Li, et al.
Published: (2021-01-01) -
Revisiting norm optimization for multi-objective black-box problems: a finite-time analysis
by: Al-Dujaili, Abdullah, et al.
Published: (2021) -
Black-Box for Blockchain Parameters Adjustment
by: Vladislav Amelin, et al.
Published: (2022-01-01) -
Advances in meta-heuristic methods for large-scale black-box optimization problems
by: Puyu JIANG, et al.
Published: (2021-08-01) -
Sampling Effects on Algorithm Selection for Continuous Black-Box Optimization
by: Mario Andrés Muñoz, et al.
Published: (2021-01-01)