Scholarlink

<p>The alternating direction method of multipliers (ADMM) is popular and powerful in computing the solutions of various composite minimization problems with constraints. In this paper, we propose a relaxed ADMM with a general dual step-size, which includes the classic ADMM in the algorithm framework, for minimizing separable nonconvex functions with linear constraints. Under some assumptions on the penalty parameter and the objective function, the convergence of the proposed algorithm is obtained based on the Kurdyka–Łojasiewicz property. Moreover, we report some preliminary numerical results on involving matrix decomposition problem to demonstrate the feasibility and effectiveness of the proposed method.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Relaxed Alternating Direction Method Of Multipliers For Separable Nonconvex Minimization Problems

  • 期刊论文

  • 发表日期：

    2025年7月15日

查看全文
  • Jing Zhao,
  • Chenzheng Guo,
  • Xiaolong Qin

摘要

The alternating direction method of multipliers (ADMM) is popular and powerful in computing the solutions of various composite minimization problems with constraints. In this paper, we propose a relaxed ADMM with a general dual step-size, which includes the classic ADMM in the algorithm framework, for minimizing separable nonconvex functions with linear constraints. Under some assumptions on the penalty parameter and the objective function, the convergence of the proposed algorithm is obtained based on the Kurdyka–Łojasiewicz property. Moreover, we report some preliminary numerical results on involving matrix decomposition problem to demonstrate the feasibility and effectiveness of the proposed method.