On the asymptotic stability of proximal algorithms for convex optimization problems with multiple non-smooth regularizers

被引:0
|
作者
Ozaslan, Ibrahim K. [1 ]
Hassan-Moghaddam, Sepideh [2 ]
Jovanovic, Mihailo R. [1 ]
机构
[1] Univ Southern Calif, Ming Hsieh Dept Elect Engn, Los Angeles, CA 90089 USA
[2] Microsoft, Redmond, WA USA
来源
2022 AMERICAN CONTROL CONFERENCE, ACC | 2022年
基金
美国国家科学基金会;
关键词
Asymptotic stability; composite optimization; gradient flow dynamics; Lyapunov functions; proximal operator; proximal augmented Lagrangian; operator splitting; CONVERGENCE; DYNAMICS; ADMM;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider composite optimization problems in which the objective function is given by the sum of a smooth convex term and multiple, potentially non-differentiable, convex regularizers. We show that a primal-dual method based on the proximal augmented Lagrangian, which was originally introduced for problems with two components, can be directly extended to this multi-block case. Moreover, we prove that the continuous-time primal-dual dynamics resulting from the proximal augmented Lagrangian are globally asymptotically stable even in the multi-block case if the set of equilibrium points is compact. This is in contrast to ADMM where additional assumptions, e.g., strong convexity of some components, are required. We then examine three-block problems with two non-smooth regularizers and establish global asymptotic stability of splitting dynamic resulting from the proximal augmented Lagrangian.
引用
收藏
页码:132 / 137
页数:6
相关论文
共 50 条
  • [1] Stochastic Optimization for DC Functions and Non-smooth Non-convex Regularizers with Non-asymptotic Convergence
    Xu, Yi
    Qi, Qi
    Lin, Qihang
    Jin, Rong
    Yang, Tianbao
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [2] DIFFUSION STOCHASTIC OPTIMIZATION WITH NON-SMOOTH REGULARIZERS
    Vlaski, Stefan
    Vandenberghe, Lieven
    Sayed, Ali H.
    2016 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING PROCEEDINGS, 2016, : 4149 - 4153
  • [3] Convergence Rate Comparison of Proximal Algorithms for Non-Smooth Convex Optimization With an Application to Texture Segmentation
    Briceno-Arias, L. M.
    Pustelnik, N.
    IEEE SIGNAL PROCESSING LETTERS, 2022, 29 : 1337 - 1341
  • [4] Inertial self-adaptive algorithms for solving non-smooth convex optimization problems
    Chen, Xin
    Duan, Peichao
    NUMERICAL ALGORITHMS, 2025, 98 (01) : 133 - 163
  • [5] Decentralized Dual Proximal Gradient Algorithms for Non-Smooth Constrained Composite Optimization Problems
    Li, Huaqing
    Hu, Jinhui
    Ran, Liang
    Wang, Zheng
    Lu, Qingguo
    Du, Zhenyuan
    Huang, Tingwen
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2021, 32 (10) : 2594 - 2605
  • [6] Inertial Block Proximal Methods For Non-Convex Non-Smooth Optimization
    Le Thi Khanh Hien
    Gillis, Nicolas
    Patrinos, Panagiotis
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [7] Inexact Proximal Gradient Methods for Non-Convex and Non-Smooth Optimization
    Gu, Bin
    Wang, De
    Huo, Zhouyuan
    Huang, Heng
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 3093 - 3100
  • [8] Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization
    Metel, Michael R.
    Takeda, Akiko
    JOURNAL OF MACHINE LEARNING RESEARCH, 2021, 22
  • [9] Stochastic proximal methods for non-smooth non-convex constrained sparse optimization
    Metel, Michael R.
    Takeda, Akiko
    Journal of Machine Learning Research, 2021, 22
  • [10] On the Linear Convergence of the Approximate Proximal Splitting Method for Non-smooth Convex Optimization
    Kadkhodaie M.
    Sanjabi M.
    Luo Z.-Q.
    Journal of the Operations Research Society of China, 2014, 2 (2) : 123 - 141