2026-07-19T03:57:56Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:143 2024-03-06T11:05:56Z ddc:004 open_access

Optimal algorithms for global optimization in case of unknown Lipschitz constant Horn, Matthias U. Global optimization Lipschitz functions optimal rate of convergence complexity We consider a family of function classes which allow functions with several minima and which demand only Lipschitz continuity for smoothness. We present an algorithm almost optimal for each of these classes. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Matthias U. Horn 2005 Is Part Of Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.04401.11 urn:nbn:de:0030-drops-1430 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.11 eng https://creativecommons.org/licenses/by/4.0/legalcode