一种面向不可微函数的非精确增强凸函数差算法
An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
AI总结:
针对首个DC分量不可微时BDCA方向可能变为上升方向、单调线搜索失效的问题,提出含两个非精确特性的InmBDCA,证明其良定义与聚点临界性,给出迭代复杂度界,实验表明其性能优于nmBDCA和单调DCA。
摘要:
本文提出一种针对增强凸函数差算法(Boosted Difference of Convex Functions Algorithm, BDCA)的非精确方法,用于求解包含两个凸函数(DC函数)之差的非凸不可微问题。具体而言,当第一个DC分量可微而第二个可能不可微时,BDCA利用凸函数差算法(DC Algorithm, DCA)子问题的解来定义目标函数的下降方向,随后执行单调线搜索,找到一个相较于子问题解能提升目标函数值的新点,该方法提升了DCA的性能。但当第一个DC分量不可微时,BDCA方向可能变为上升方向,导致单调线搜索失效。为解决这一问题,我们提出非精确非单调增强凸函数差算法(Inexact nonmonotone Boosted Difference of Convex Algorithm, InmBDCA)。该算法包含两个核心非精确特性:第一,子问题被近似求解,允许在定义线搜索方向时设置可控的相对误差容限;第二,采用非精确非单调线搜索方案确定下一次迭代的步长。在合适的假设条件下,我们证明InmBDCA是良定义的,其生成序列的任意聚点都是问题的临界点,同时还给出了该算法的迭代复杂度界。数值实验表明,在实际场景中InmBDCA的性能优于非光滑BDCA(nmBDCA)和单调版本的DCA。
英文摘要:
In this paper, we introduce an inexact approach to the Boosted Difference of Convex Functions Algorithm (BDCA) for solving nonconvex and nondifferentiable problems involving the difference of two convex functions (DC functions). Specifically, when the first DC component is differentiable and the second may be nondifferentiable, BDCA utilizes the solution from the subproblem of the DC Algorithm (DCA) to define a descent direction for the objective function. A monotone linesearch is then performed to find a new point that improves the objective function relative to the subproblem solution. This approach enhances the performance of DCA. However, if the first DC component is nondifferentiable, the BDCA direction may become an ascent direction, rendering the monotone linesearch ineffective. To address this, we propose an Inexact nonmonotone Boosted Difference of Convex Algorithm (InmBDCA). This algorithm incorporates two main features of inexactness: First, the subproblem therein is solved approximately allowing us for a controlled relative error tolerance in defining the linesearch direction. Second, an inexact nonmonotone linesearch scheme is used to determine the step size for the next iteration. Under suitable assumptions, we demonstrate that InmBDCA is well-defined, with any accumulation point of the sequence generated by InmBDCA being a critical point of the problem. We also provide iteration-complexity bounds for the algorithm. Numerical experiments show that InmBDCA outperforms both the nonsmooth BDCA (nmBDCA) and the monotone version of DCA in practical scenarios.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。