Erratum, counterexample and an additional revealing poll step for a result of "Analysis of direct searches for discontinuous functions''
Charles Audet, Pierre-Yves Bouchet, Lo\"ic Bourdin

TL;DR
This paper presents a counterexample to a previous theorem on direct search methods for discontinuous functions, revealing flaws and proposing a modified method to address these issues.
Contribution
It provides a counterexample that invalidates a prior theorem and introduces a modified direct search method to recover the original properties.
Findings
Counterexample invalidates the previous theorem.
The original method may converge to discontinuities with incorrect function values.
A modified dDSM recovers the broken properties.
Abstract
This note provides a counterexample to a theorem announced in the last part of the paper ''Analysis of direct searches for discontinuous functions'', Mathematical Programming Vol. 133, pp.~299--325, 2012. The counterexample involves an objective function which satisfies all the assumptions required by the theorem but contradicts some of its conclusions. A corollary of this theorem is also affected by this counterexample. The main flaw revealed by the counterexample is the possibility that a directional direct search method (dDSM) generates a sequence of trial points converging to a point where is discontinuous and whose objective function value is strictly less than . Moreover the dDSM generates no trial point in one of the two branches of near . This note also investigates the proof of the…
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
TopicsOptimization and Search Problems · Metaheuristic Optimization Algorithms Research · Advanced Bandit Algorithms Research
