标题： 基于二阶近似的凸规划中Rockafellar的乘子邻近法的迭代复杂性 显示英文标题

标题： Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations

摘要： 本文研究了一种基于Rockafellar的乘子邻近法(PMM)的新原始对偶算法在求解具有不等式约束的光滑凸规划问题中的迭代复杂度。 在每一步中，要么计算该问题的二阶模型的Rockafellar的PMM步骤，要么执行一个松弛的外梯度步骤。 所得算法是一种（大步长）松弛混合邻近外梯度（r-HPE）乘子方法，它将Rockafellar的PMM与r-HPE方法相结合。 显示英文摘要

摘要： This paper studies the iteration-complexity of a new primal-dual algorithm based on Rockafellar's proximal method of multipliers (PMM) for solving smooth convex programming problems with inequality constraints. In each step, either a step of Rockafellar's PMM for a second-order model of the problem is computed or a relaxed extragradient step is performed. The resulting algorithm is a (large-step) relaxed hybrid proximal extragradient (r-HPE) method of multipliers, which combines Rockafellar's PMM with the r-HPE method.