A tabu search scheme for abstract problems, with applications to the computation of fixed points

Juan Enrique Martínez-Legaz, Antoine Soubeyran

Research output: Contribution to journalArticleResearchpeer-review

2 Citations (Scopus)

Abstract

We present a general tabu search iterative algorithm to solve abstract problems on metric spaces. At each iteration, if the current solution turns out to be unacceptable then a neighborhood of unacceptable solutions is determined and excluded for further exploration, in such a way that, under mild assumptions, an acceptable solution is asymptotically reached. Thus our algorithm makes a crucial use of memory to avoid visiting unacceptable solutions more than once. We also present a specialization of our general method to the computation of fixed points. © 2007 Elsevier Inc. All rights reserved.
Original languageEnglish
Pages (from-to)620-627
JournalJournal of Mathematical Analysis and Applications
Volume338
DOIs
Publication statusPublished - 1 Feb 2008

Keywords

  • Abstract problems in metric spaces
  • Fixed points
  • Tabu search

Fingerprint Dive into the research topics of 'A tabu search scheme for abstract problems, with applications to the computation of fixed points'. Together they form a unique fingerprint.

Cite this