arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2210.15531math.OC
收藏

各向异性近端梯度

Anisotropic Proximal Gradient

Emanuel Laude, Panagiotis Patrinos

AI总结:

本文提出一种基于双空间非线性预处理的非凸复合最小化各向异性近端梯度算法,证明了其在特定条件下的封闭性、渐近与线性收敛性,并在数值实验中展现出优于欧几里得方法的性能。

摘要:

本文研究了一种用于非凸复合最小化的新算法,该算法可被解释为经典近端梯度方法在双空间中的非线性预处理。所提方案可应用于可加复合最小化问题,其光滑部分相对于参考函数表现出各向异性下降不等式。若由共轭参考函数生成的 Bregman 距离是联合凸的,则证明了各向异性下降性质在逐点平均下是封闭的。更具体地,对于指数参考函数,证明了其在逐点锥组合下的封闭性。我们分析了该方法的渐近收敛性,并在各向异性近端梯度优势条件下证明了其线性收敛性。讨论了包括指数正则化 LPs 和带非光滑正则化的逻辑回归在内的应用。在数值实验中,展示了所提方法相比其欧几里得对应方法的显著改进。

英文摘要:

This paper studies a novel algorithm for nonconvex composite minimization which can be interpreted in terms of dual space nonlinear preconditioning for the classical proximal gradient method. The proposed scheme can be applied to additive composite minimization problems whose smooth part exhibits an anisotropic descent inequality relative to a reference function. It is proved that the anisotropic descent property is closed under pointwise average if the Bregman distance generated by the conjugate reference function is jointly convex. More specifically, for the exponential reference function we prove its closedness under pointwise conic combinations. We analyze the method's asymptotic convergence and prove its linear convergence under an anisotropic proximal gradient dominance condition. Applications are discussed including exponentially regularized LPs and logistic regression with nonsmooth regularization. In numerical experiments we show significant improvements of the proposed method over its Euclidean counterparts.

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

↑