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

一类复合优化问题的扰动分析

Perturbation analysis of a class of composite optimization problems

Hangzhou City University(杭州城市大学);Southwest Jiaotong University(西南交通大学)

Peipei Tang, Chengjing Wang

AI总结:

本文研究了一类复合优化问题的扰动分析,提出强二阶充分条件并证明其与非退化条件等价,为设计高效算法奠定理论基础。

摘要:

本文研究了一类复合优化问题的扰动分析,该问题为约束优化问题的理论和算法发展提供了统一框架。在某些温和假设下,我们为复合优化问题定义了强二阶充分条件(SSOSC),并证明SSOSC与非退化条件、Clarke广义雅可比在KKT点的非奇异性和KKT点的强正则性等条件等价。对于凸复合优化问题,我们建立了原问题/对偶问题二阶充分条件与对偶问题/原问题严格Robinson约束资格的等价性,以及原问题/对偶问题SSOSC与对偶问题/原问题非退化条件的等价性。此外,我们证明了对偶非退化条件与增广拉格朗日方法子问题Clarke广义雅可比的非奇异性的等价性。这些理论结果为设计高效算法奠定了坚实基础。

英文摘要:

In this paper, we study the perturbation analysis of a class of composite optimization problems, which is a very convenient and unified framework for developing both theoretical and algorithmic issues of constrained optimization problems. The underlying theme of this paper is very important in both theoretical and computational study of optimization problems. Under some mild assumptions on the objective function, we provide a definition of a strong second order sufficient condition (SSOSC) for the composite optimization problem and also prove that the following conditions are equivalent to each other: the SSOSC and the nondegeneracy condition, the nonsingularity of Clarke's generalized Jacobian of the nonsmooth system at a Karush-Kuhn-Tucker (KKT) point, and the strong regularity of the KKT point. These results provide an important way to characterize the stability of the KKT point. As for the convex composite optimization problem, which is a special case of the general problem, we establish the equivalence between the primal/dual second order sufficient condition and the dual/primal strict Robinson constraint qualification, the equivalence between the primal/dual SSOSC and the dual/primal nondegeneracy condition. Moreover, we prove that the dual nondegeneracy condition and the nonsingularity of Clarke's generalized Jacobian of the subproblem corresponding to the augmented Lagrangian method are also equivalent to each other. These theoretical results lay solid foundation for designing an efficient algorithm.

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

↑