对数和正则化的带保护条件的加速ADMM算法
Log-Sum Accelerated ADMM Algorithm with Protection Conditions
DOI: 10.12677/orf.2025.156260, PDF,    科研立项经费支持
作者: 曾子昕:重庆交通大学数学与统计学院,重庆;黄 华*, 李明华:重庆文理学院数学与人工智能学院,重庆
关键词: ADMM对数和正则化Nesterov保护条件ADMM Log-Sum Regularization Nesterov Protection Conditions
摘要: 本文针对稀疏信号恢复问题,提出了一种基于对数和正则化模型的带有保护条件的Nesterov加速ADMM算法(nADMMgd)。该算法通过引入Nesterov加速技术有效提高了收敛速率,并利用保护条件保障了算法的稳定性。数值实验表明,nADMMgd算法在稀疏信号恢复问题上表现出色,能够在较短的时间内达到更优的函数值,且在计算大规模数据时具有良好的表现。实验验证了保护条件对计算效率方面提升的积极作用,还验证了nADMMgd对比目前用于计算对数和正则化的算法得到的结果更加精确。总体而言,本文提出的算法在稀疏信号恢复问题中具有显著的优势。
Abstract: This paper proposes a Nesterov-accelerated ADMM algorithm with protection conditions, referred to as nADMMgd, for sparse signal recovery based on logarithmic and regularization models. By incorporating Nesterov acceleration techniques, the algorithm achieves an improved convergence rate, while the integration of protective conditions enhances its numerical stability. Numerical experiments demonstrate that nADMMgd performs effectively in sparse signal recovery tasks, attaining superior objective function values within reduced computational time and exhibiting robust performance on large-scale datasets. The experimental results confirm the positive impact of the protective conditions on computational efficiency and further validate that nADMMgd yields more accurate solutions compared to state-of-the-art algorithms currently employed for logarithmic and regularized optimization. Overall, the proposed method presents significant advantages in addressing sparse signal recovery problems.
文章引用:曾子昕, 黄华, 李明华. 对数和正则化的带保护条件的加速ADMM算法[J]. 运筹与模糊学, 2025, 15(6): 100-108. https://doi.org/10.12677/orf.2025.156260

参考文献

[1] 胡耀华, 李昱帆, 刘艳艳, 等. 结构稀疏优化模型的理论与算法[J]. 中国科学: 数学, 2024, 54(7): 1045-1070.
[2] Donoho, D.L. (2006) Compressed Sensing. IEEE Transactions on Information Theory, 52, 1289-1306. [Google Scholar] [CrossRef
[3] Candes, E.J. and Tao, T. (2005) Decoding by Linear Programming. IEEE Transactions on Information Theory, 51, 4203-4215. [Google Scholar] [CrossRef
[4] Natarajan, B.K. (1995) Sparse Approximate Solutions to Linear Systems. SIAM Journal on Computing, 24, 227-234. [Google Scholar] [CrossRef
[5] Tibshirani, R. (1996) Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society Series B: Statistical Methodology, 58, 267-288. [Google Scholar] [CrossRef
[6] Candès, E.J., Wakin, M.B. and Boyd, S.P. (2008) Enhancing Sparsity by Reweighted L1 Minimization. Journal of Fourier Analysis and Applications, 14, 877-905. [Google Scholar] [CrossRef
[7] Zhou, X., Liu, X., Zhang, G., Jia, L., Wang, X. and Zhao, Z. (2023) An Iterative Threshold Algorithm of Log-Sum Regularization for Sparse Problem. IEEE Transactions on Circuits and Systems for Video Technology, 33, 4728-4740. [Google Scholar] [CrossRef
[8] Yu, P. and Pong, T.K. (2019) Iteratively Reweighted L1 Algorithms with Extrapolation. Computational Optimization and Applications, 73, 353-386. [Google Scholar] [CrossRef
[9] 张海林. 带有保护条件的ν加速ADMM算法[J]. 理论数学, 2025, 15(4): 298-308.
[10] Wang, Y., Yin, W. and Zeng, J. (2019) Global Convergence of ADMM in Nonconvex Nonsmooth Optimization. Journal of Scientific Computing, 78, 29-63. [Google Scholar] [CrossRef
[11] Zeng, Y., Wang, Z., Bai, J. and Shen, X. (2024) An Accelerated Stochastic ADMM for Nonconvex and Nonsmooth Finite-Sum Optimization. Automatica, 163, Article 111554. [Google Scholar] [CrossRef
[12] Buccini, A., Dell’Acqua, P. and Donatelli, M. (2020) A General Framework for ADMM Acceleration. Numerical Algorithms, 85, 829-848. [Google Scholar] [CrossRef
[13] Nesterov, Y. (2013) Gradient Methods for Minimizing Composite Functions. Mathematical Programming, 140, 125-161. [Google Scholar] [CrossRef