arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.10801math.OC
收藏

有界约束问题的无导数方法的复杂度结果与主动集识别

Complexity results and active-set identification of a derivative-free method for bound-constrained problems

Sapienza University of Rome(罗马大学);University of Rome “Tor Vergata”(罗马托尔维加特大学)

Andrea Brilli, Andrea Cristofari, Giampaolo Liuzzi, Stefano Lucidi

AI总结:

本文分析了一种针对有界约束问题的无导数线搜索方法,证明了其最坏情况复杂度与其他无导数方法相当,并展示了该方法能有限步内正确识别满足严格互补条件的主动约束。

摘要:

本文分析了一种针对有界约束问题的无导数线搜索方法。我们的分析表明,该方法在最坏情况下的复杂度与用于无约束和线性约束问题的其他无导数方法相当。特别地,当最小化一个具有$n$个变量的函数时,我们证明最多需要${\cal O(n\epsilon^{-2})}$次迭代即可将临界性度量降至预定义阈值$\epsilon$以下,且最多需要${\cal O(n^2\epsilon^{-2})}$次函数评估。我们还证明了临界性度量不低于$\epsilon$的总迭代次数上界为${\cal O(n^2\epsilon^{-2})}$。此外,我们研究了该方法在最终解处识别主动约束的能力。我们证明,在有限次迭代后,所有满足严格互补条件的主动约束都被正确识别。

英文摘要:

In this paper, we analyze a derivative-free line search method designed for bound-constrained problems. Our analysis demonstrates that this method exhibits a worst-case complexity comparable to other derivative-free methods for unconstrained and linearly constrained problems. In particular, when minimizing a function with $n$ variables, we prove that at most ${\cal O(nε^{-2})}$ iterations are needed to drive a criticality measure below a predefined threshold $ε$, requiring at most ${\cal O(n^2ε^{-2})}$ function evaluations. We also show that the total number of iterations where the criticality measure is not below $ε$ is upper bounded by ${\cal O(n^2ε^{-2})}$. Moreover, we investigate the method capability to identify active constraints at the final solutions. We show that, after a finite number of iterations, all the active constraints satisfying the strict complementarity condition are correctly identified.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑