Iterative optimization -Complexity and Efficiency are not antinomic - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail (Preprint/Prepublication) Année : 2024

Iterative optimization -Complexity and Efficiency are not antinomic

Résumé

When we compare two algorithms, complexity and efficiency are often thought of as almost the same, implying that low complexity indicates good efficiency. However, these two concepts are actually distinct. We provide theoretical reasons and a few examples to demonstrate that an algorithm can be both more complex and more efficient than another at the same time. We also address several common misconceptions about iterative optimization. Problem size Time complexity - Thanks: To my colleague and friend Mohamed G. Omran for our fruitful discussions. Even though he doesn't agree with all my conclusions!
Fichier principal
Vignette du fichier
Complexities vs Efficiencies.pdf (719.08 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04487869 , version 1 (04-03-2024)

Identifiants

Citer

Maurice Clerc. Iterative optimization -Complexity and Efficiency are not antinomic. 2024. ⟨hal-04487869⟩

Collections

LISSI UPEC
4 Consultations
3 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More