🌙

对偶下降增广拉格朗日方法与交替方向乘子法

Dual Descent Augmented Lagrangian Method and Alternating Direction Method of Multipliers

SIAM Journal on Optimization · 2024
被引 6
ABS 3

中文导读

针对非凸约束优化,提出一类新型原始对偶算法,将对偶上升反转成对偶下降,使对偶变量与原始变量地位平等,并给出两种具体算法及其迭代复杂度。

Abstract

.Classical primal-dual algorithms attempt to solve \(\max_{\mu }\min_{x} \mathcal{L}(x,\mu )\) by alternately minimizing over the primal variable \(x\) through primal descent and maximizing the dual variable \(\mu\) through dual ascent. However, when \(\mathcal{L}(x,\mu )\) is highly nonconvex with complex constraints in \(x\), the minimization over \(x\) may not achieve global optimality and, hence, the dual ascent step loses its valid intuition. This observation motivates us to propose a new class of primal-dual algorithms for nonconvex constrained optimization with the key feature to reverse dual ascent to a conceptually new dual descent, in a sense, elevating the dual variable to the same status as the primal variable. Surprisingly, this new dual scheme achieves some best iteration complexities for solving nonconvex optimization problems. In particular, when the dual descent step is scaled by a fractional constant, we name it scaled dual descent (SDD), otherwise, unscaled dual descent (UDD). For nonconvex multiblock optimization with nonlinear equality constraints, we propose SDD-alternating direction method of multipliers (SDD-ADMM) and show that it finds an \(\epsilon\)-stationary solution in \(\mathcal{O}(\epsilon^{-4})\) iterations. The complexity is further improved to \(\mathcal{O}(\epsilon^{-3})\) and \(\mathcal{O}(\epsilon^{-2})\) under proper conditions. We also propose UDD-augmented Lagrangian method (UDD-ALM), combining UDD with ALM, for weakly convex minimization over affine constraints. We show that UDD-ALM finds an \(\epsilon\)-stationary solution in \(\mathcal{O}(\epsilon^{-2})\) iterations. These complexity bounds for both algorithms either achieve or improve the best-known results in the ADMM and ALM literature. Moreover, SDD-ADMM addresses a long-standing limitation of existing ADMM frameworks.Keywordsaugmented Lagrangian methodalternating direction method of multipliersMSC codes65K0590C2690C3090C46

非凸优化原始对偶算法增广拉格朗日方法交替方向乘子法