A proximal alternating direction method of multipliers with a proximal-perturbed Lagrangian function for nonconvex and nonsmooth structured optimization

被引:0
作者
Li, Bohan [1 ]
Liu, Pengjie [1 ]
Shao, Hu [1 ]
Wu, Ting [2 ]
Xu, Jiawei [3 ]
机构
[1] China Univ Min & Technol, Jiangsu Ctr Appl Math CUMT, Sch Math, Xuzhou 221116, Peoples R China
[2] Nanjing Univ, Sch Math, Nanjing 210093, Peoples R China
[3] Xiangtan Univ, Sch Math & Computat Sci, Xiangtan 411105, Peoples R China
基金
中国国家自然科学基金;
关键词
Nonconvex and nonsmooth structured optimization; Proximal alternating direction method of multipliers; Proximal-perturbed Lagrangian function; Theoretical convergence; MINIMIZATION;
D O I
10.1007/s11590-025-02212-6
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Building on Yin et al. (J Glob Optim 89:899-926, 2024), we continue to focus on solving a nonconvex and nonsmooth structured optimization problem with linear and closed convex set constraints, where its objective function is the sum of a convex (possibly nonsmooth) function and a smooth (possibly nonconvex) function. Based on the traditional augmented Lagrangian construction, we introduce a proximal-perturbed Lagrangian function and propose a proximal alternating direction method of multipliers that leverages this new Lagrangian-based formulation. We establish that the iterative subsequence obtained by the proposed method converges to a stationary point under standard assumptions.
引用
收藏
页数:14
相关论文
共 23 条
[1]  
[Anonymous], 2014, Introductory Lectures on Convex Optimization: A Basic Course
[2]  
Bai J.C., 2024, A proximal-perturbed Bregman ADMM for solving nonsmooth and nonconvex optimization problems
[3]   Generalized Asymmetric Forward-Backward-Adjoint Algorithms for Convex-Concave Saddle-Point Problem [J].
Bai, Jianchao ;
Chen, Yang ;
Yu, Xue ;
Zhang, Hongchao .
JOURNAL OF SCIENTIFIC COMPUTING, 2025, 102 (03)
[4]  
Bai JC, 2025, COMPUT OPTIM APPL, V90, P445, DOI 10.1007/s10589-024-00643-y
[5]   A New Insight on Augmented Lagrangian Method with Applications in Machine Learning [J].
Bai, Jianchao ;
Jia, Linyuan ;
Peng, Zheng .
JOURNAL OF SCIENTIFIC COMPUTING, 2024, 99 (02)
[6]   An inexact accelerated stochastic ADMM for separable convex optimization [J].
Bai, Jianchao ;
Hager, William W. ;
Zhang, Hongchao .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 81 (02) :479-518
[7]   Generalized symmetric ADMM for separable convex optimization [J].
Bai, Jianchao ;
Li, Jicheng ;
Xu, Fengmin ;
Zhang, Hongchao .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2018, 70 (01) :129-170
[8]   Proximal alternating linearized minimization for nonconvex and nonsmooth problems [J].
Bolte, Jerome ;
Sabach, Shoham ;
Teboulle, Marc .
MATHEMATICAL PROGRAMMING, 2014, 146 (1-2) :459-494
[9]   The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates [J].
Bot, Radu Ioan ;
Dang-Khoa Nguyen .
MATHEMATICS OF OPERATIONS RESEARCH, 2020, 45 (02) :682-712
[10]   A PROXIMAL MINIMIZATION ALGORITHM FOR STRUCTURED NONCONVEX AND NONSMOOTH PROBLEMS [J].
Bot, Radu Ioan ;
Csetnek, Erno Robert ;
Dang-Khoa Nguyen .
SIAM JOURNAL ON OPTIMIZATION, 2019, 29 (02) :1300-1328