Challenges of Convex Quadratic Bi-objective Benchmark Problems

genetic and evolutionary computation conference, 2019.

Cited by: 1|Bibtex|Views9|Links
EI

Abstract:

Convex quadratic objective functions are an important base case in state-of-the-art benchmark collections for single-objective optimization on continuous domains. Although often considered rather simple, they represent the highly relevant challenges of non-separability and ill-conditioning. In the multi-objective case, quadratic benchmark...More

Code:

Data:

Your rating :
0

 

Best Paper
Best Paper of GECCO, 2019
Tags
Comments