Convergence towards a local minimum by direct search methods with a covering step
arxiv(2024)
摘要
This paper introduces a new step to the Direct Search Method (DSM) to
strengthen its convergence analysis. By design, this so-called covering step
may ensure that for all refined points of the sequence of incumbent solutions
generated by the resulting cDSM (covering DSM), the set of all evaluated trial
points is dense in a neighborhood of that refined point. We prove that this
additional property guarantees that all refined points are local solutions to
the optimization problem. This new result holds true even for discontinuous
objective function, under a mild assumption that we discuss in details. We also
provide a practical construction scheme for the covering step that works at low
additional cost per iteration.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要