Challenges of Convex Quadratic Bi-objective Benchmark Problems
genetic and evolutionary computation conference, 2019.
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
PPT (Upload PPT)
Best Paper of GECCO, 2019