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

约束复合optimization和增广拉格朗日方法

Constrained composite optimization and augmented Lagrangian methods

Alberto De Marchi, Xiaoxi Jia, Christian Kanzow, Patrick Mehlitz

摘要:

我们研究有限维约束结构最优化问题,具有复合目标函数和集员约束。这个问题类提供了一种表达性强但简单的语言,为各种应用程序提供了一个建模框架。我们研究平稳性和规律性的概念,并提出了一个灵活的增广拉格朗日计划。我们提供了一个理论表征的算法及其渐近性质,推导出完全非凸问题的收敛结果。它演示了如何内部子问题可以解决现成的近端的方法,尽管有可能采用任何求解器,只要他们返回近似的固定点。最后,我们描述了我们的矩阵的实现所提出的算法和数值测试。说明性的例子显示了多功能性的约束复合程序作为建模工具,并暴露在这个庞大的问题类所产生的困难。

英文摘要:

We investigate finite-dimensional constrained structured optimization problems, featuring composite objective functions and set-membership constraints. Offering an expressive yet simple language, this problem class provides a modeling framework for a variety of applications. We study stationarity and regularity concepts, and propose a flexible augmented Lagrangian scheme. We provide a theoretical characterization of the algorithm and its asymptotic properties, deriving convergence results for fully nonconvex problems. It is demonstrated how the inner subproblems can be solved by off-the-shelf proximal methods, notwithstanding the possibility to adopt any solvers, insofar as they return approximate stationary points. Finally, we describe our matrix-free implementation of the proposed algorithm and test it numerically. Illustrative examples show the versatility of constrained composite programs as a modeling tool and expose difficulties arising in this vast problem class.

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

↑