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

一类渐近可逼近非凸问题的变分理论与算法

Variational Theory and Algorithms for a Class of Asymptotically Approachable Nonconvex Problems

Hanyang Li, Ying Cui

AI总结:

本文针对内层函数可能非局部Lipschitz连续的复合非凸优化问题,提出保证epi-收敛的渐近分解方法,建立必要最优性条件并设计相应数值算法,扩展了amenable函数与prox-linear方法的理论框架。

摘要:

我们研究一类复合非凸函数,其中外层函数是单变量扩展实值凸函数之和,内层函数是差凸函数的极限。该类函数的一个显著特征是内层函数可能不满足局部Lipschitz连续。它涵盖了一系列重要但具有挑战性的应用,包括逆最优值优化和在风险价值约束下的问题。我们提出该复合函数的一种渐近分解,该分解保证了对原函数的epi-收敛,从而为相应的极小化问题导出了必要最优性条件。所提出的分解还使我们能够设计一种数值算法,使得所生成序列的任何聚点(若存在)都满足新引入的最优性条件。这些结果扩展了Poliquin和Rockafellar于1992年提出的所谓amenable函数(即凸函数与光滑映射的复合)及其极小化的prox-linear方法的研究。为了证明我们的算法框架在实际中是可实现的,我们进一步给出了可验证的终止准则和初步数值结果。

英文摘要:

We investigate a class of composite nonconvex functions, where the outer function is the sum of univariate extended-real-valued convex functions and the inner function is the limit of difference-of-convex functions. A notable feature of this class is that the inner function may fail to be locally Lipschitz continuous. It covers a range of important yet challenging applications, including inverse optimal value optimization and problems under value-at-risk constraints. We propose an asymptotic decomposition of the composite function that guarantees epi-convergence to the original function, leading to necessary optimality conditions for the corresponding minimization problem. The proposed decomposition also enables us to design a numerical algorithm such that any accumulation point of the generated sequence, if exists, satisfies the newly introduced optimality conditions. These results expand on the study of so-called amenable functions introduced by Poliquin and Rockafellar in 1992, which are compositions of convex functions with smooth maps, and the prox-linear methods for their minimization. To demonstrate that our algorithmic framework is practically implementable, we further present verifiable termination criteria and preliminary numerical results.

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

↑