具有双重松弛项的改进惯性近端交替方向乘子法在结构化非凸和非光滑问题中的应用
Application of the Modified Inertial Proximal Alternating Direction Method of Multipliers with Dual-Relaxed Term for Structured Nonconvex and Nonsmooth Problems
摘要: 针对结构化的非凸非光滑优化问题,提出了一种改进的惯性近端交替方向乘子法(Modified Inertial Proximal Alternating Direction Method of Multipliers, MID-PADMM)。该问题在多个领域,包括机器学习、信号处理和经济学中具有重要应用。现有算法在处理这类问题时,往往面临收敛速度慢或无法保证收敛的挑战。为了克服这些限制,引入了一种双重松弛项,以增强算法的鲁棒性和灵活性。理论分析表明,MID-PADMM算法在适当的条件下能够实现全局收敛,并且具有O(1/k)的迭代复杂度,其中k代表迭代次数。数值实验结果表明,与现有的状态最优算法相比,MID-PADMM在多个实例中展现出更快的收敛速度和更高的求解质量。
Abstract: For structured nonconvex and nonsmooth optimization problems, we propose a Modified Inertial Proximal Alternating Direction Method of Multipliers (MID-PADMM). These problems are significantly applied in various domains, including machine learning, signal processing, and economics. Existing algorithms often face challenges such as slow convergence or the inability to guarantee convergence when dealing with such problems. To overcome these limitations, we introduce a dual-relaxed term to enhance the robustness and flexibility of the algorithm. The theoretical analysis shows that the MID-PADMM algorithm can achieve global convergence under suitable conditions and has an iteration complexity of O(1/k), where k represents the number of iterations. Numerical experimental results demonstrate that, compared to the current state-of-the-art algorithms, MID-PADMM exhibits faster convergence rates and higher solution quality in multiple instances.
文章引用:陈昱, 薛中会. 具有双重松弛项的改进惯性近端交替方向乘子法在结构化非凸和非光滑问题中的应用[J]. 理论数学, 2024, 14(6): 351-361. https://doi.org/10.12677/pm.2024.146255

参考文献

[1] Sleem, O.M., Ashour, M.E., Aybat, N.S. and Lagoa, C.M. (2024) Lp Quasi-Norm Minimization: Algorithm and Applications. EURASIP Journal on Advances in Signal Processing, 2024, Article No. 22. [Google Scholar] [CrossRef
[2] Zhao, Y., Liao, X.F., He, X. and Tang, R.Q. (2021) Smoothing Inertial Neurodynamic Approach for Sparse Signal Reconstruction via Lp-Norm Minimization. Neural Networks, 140, 100-112.
[3] Huang, A. and Zhang, L. (2020) Stable Recovery of Sparse Signals with Non-Convex Weighted R-Norm Minimization.
[4] Foucart, S. and Lai, H. (2013) Sparse Recovery Algorithms: Uniqueness Conditions and Non-Convex Optimization. SIAM Journal on Numerical Analysis, 51, 858-884.
[5] Tropp, J.A. (2006) Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise. IEEE Transactions on Information Theory, 52, 1030-1051. [Google Scholar] [CrossRef
[6] Candès, E. and Tao, T. (2007) Rejoinder: The Dantzig Selector: Statistical Estimation When P Is Much Larger than N. The Annals of Statistics, 35, 2313-2351. [Google Scholar] [CrossRef
[7] Zhao, Z. and Chen, G. (2014) A New Method for Signal Reconstruction of Lp-Norm Optimization. Advances in Applied Mathematics, 3, 140-148. [Google Scholar] [CrossRef
[8] Fornasier, M. and Rauhut, H. (2008) Iterative Thresholding for Sparse Approximation. Constructive Approximation, 28, 307-336.
[9] Jacques, L., Pesquet, J.-C. and He, H. (2014) A Plug-and-Play Approach to Sparse Signal Recovery with Application to DOA Estimation. IEEE Transactions on Signal Processing, 62, 273-286.
[10] Donoho, D.L. (2006) High Dimensional Sparse Signal Recovery via l1 Minimization. Proceedings of the National Academy of Sciences, 102, 9446-9451.
[11] Bertsekas, D.P. (2016) Nonlinear Programming. 3rd Edition, Athena Scientific, Nashua.
[12] Beck, A. and Teboulle, M. (2009) A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems. SIAM Journal on Imaging Sciences, 2, 183-202. [Google Scholar] [CrossRef
[13] Boyd, S., Parikh, N., Chu, E., Peleato, B. and Eckstein, J. (2010) Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Foundations and Trends® in Machine Learning, 3, 1-122. [Google Scholar] [CrossRef
[14] Tseng, P. (2001) Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization. Journal of Optimization Theory and Applications, 109, 475-494. [Google Scholar] [CrossRef
[15] Holland, J.H. (1975) Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, Ann Arbor.
[16] Nesterov, Y. (2004) Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Dordrecht.
[17] Boţ, R.I., Csetnek, E.R. and Nguyen, D. (2019) A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems. SIAM Journal on Optimization, 29, 1300-1328. [Google Scholar] [CrossRef