A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider whether conditions exist under which block-coordinate descent is asymptotically efficient in evolutionary multi-objective optimization, addressing an open problem. Block-coordinate descent, where an optimization problem is decomposed into k blocks of decision variables and each of the blocks is optimized (with the others fixed) in a sequence, is a technique used in some large-scale optimization problems such as airline scheduling, however its use in multi-objective optimization is less studied. We propose a block-coordinate version of GSEMO and compare its running time to the standard GSEMO algorithm. Theoretical and empirical results on a bi-objective test function, a variant of LOTZ, serve to demonstrate the existence of cases where block-coordinate descent is faster. The result may yield wider insights into this class of algorithms.

Original languageEnglish
Title of host publicationGECCO 2024 - Proceedings of the 2024 Genetic and Evolutionary Computation Conference
PublisherAssociation for Computing Machinery, Inc
Pages493-501
Number of pages9
ISBN (Electronic)9798400704949
DOIs
Publication statusPublished - 14 Jul 2024
Event2024 Genetic and Evolutionary Computation Conference, GECCO 2024 - Melbourne, Australia
Duration: 14 Jul 202418 Jul 2024

Publication series

NameGECCO 2024 - Proceedings of the 2024 Genetic and Evolutionary Computation Conference

Conference

Conference2024 Genetic and Evolutionary Computation Conference, GECCO 2024
Country/TerritoryAustralia
CityMelbourne
Period14/07/2418/07/24

Keywords

  • block coordinate decent
  • evolutionary multi-objective optimization
  • runtime analysis
  • theory

Fingerprint

Dive into the research topics of 'A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis'. Together they form a unique fingerprint.

Cite this