On convergence to the global optima
K. Lakshmanan
TL;DR
This paper proves that no universal algorithm can reliably find a sequence converging to the global optimum of any continuous function with finite precision.
Contribution
It establishes a fundamental limitation in optimization, showing the impossibility of a universal convergence algorithm for all continuous functions.
Findings
No general algorithm exists for finite-precision convergence to global optima
The result applies to all continuous functions
Highlights inherent computational limitations in optimization
Abstract
We show that there is no general algorithm which finds a sequence of points with finite-precision converging computably to the global optima of any continuous function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Cellular Automata and Applications · Numerical Methods and Algorithms