A UNIFIED PROXIMAL GRADIENT METHOD FOR NONCONVEX COMPOSITE OPTIMIZATION WITH EXTRAPOLATION

被引:0
|
作者
Zhang, Miao [1 ]
Zhang, Hongchao [1 ]
机构
[1] Louisiana State Univ, Dept Math, Baton Rouge, LA 70803 USA
基金
美国国家科学基金会;
关键词
Nonconvex composite optimization; proximal gradient method; opti- mal convergence rate; accelerated gradient method; global and local linear convergence; nonsmooth optimization; ALGORITHM;
D O I
10.3934/naco.2024005G
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we propose a unified proximal gradient method with extrapolation (UPG-E) to solve a class of nonconvex and nonsmooth composite optimization. UPG-E provides a unified treatment to both convex and nonconvex problems, and adaptively estimates the nonconvexity modulus of the possibly nonconvex component function in the objective function. It is shown that without restarting the extrapolation, UPG-E achieves the optimal convergence rate of the first -order methods for solving convex composite optimization. In the case that the problem is nonconvex, the method performs as a proximal gradient method with extrapolation and guaranteed global convergence. Moreover, a linear convergence rate can be achieved by UPG-E under proper additional regularity assumptions. Our numerical experiments show the performance of UPG-E is very promising compared with other well -established proximal gradient methods in the literature.
引用
收藏
页数:23
相关论文
共 50 条
  • [1] A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems
    Wang, Qingsong
    Liu, Zehui
    Cui, Chunfeng
    Han, Deren
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 14, 2024, : 15580 - 15588
  • [2] An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
    Jia, Zehui
    Wu, Zhongming
    Dong, Xiaomei
    JOURNAL OF INEQUALITIES AND APPLICATIONS, 2019, 2019 (1)
  • [3] An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
    Zehui Jia
    Zhongming Wu
    Xiaomei Dong
    Journal of Inequalities and Applications, 2019
  • [4] A note on the accelerated proximal gradient method for nonconvex optimization
    Wang, Huijuan
    Xu, Hong-Kun
    CARPATHIAN JOURNAL OF MATHEMATICS, 2018, 34 (03) : 449 - 457
  • [5] Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds
    Feng, Shuailing
    Huang, Wen
    Song, Lele
    Ying, Shihui
    Zeng, Tieyong
    OPTIMIZATION LETTERS, 2022, 16 (08) : 2277 - 2297
  • [6] Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds
    Shuailing Feng
    Wen Huang
    Lele Song
    Shihui Ying
    Tieyong Zeng
    Optimization Letters, 2022, 16 : 2277 - 2297
  • [7] A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization
    Li, Zhize
    Li, Jian
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [8] On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
    Bonettini, S.
    Loris, I.
    Porta, F.
    Prato, M.
    Rebegoldi, S.
    INVERSE PROBLEMS, 2017, 33 (05)
  • [9] Momentum-Based Variance-Reduced Proximal Stochastic Gradient Method for Composite Nonconvex Stochastic Optimization
    Xu, Yangyang
    Xu, Yibo
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2023, 196 (01) : 266 - 297
  • [10] Momentum-Based Variance-Reduced Proximal Stochastic Gradient Method for Composite Nonconvex Stochastic Optimization
    Yangyang Xu
    Yibo Xu
    Journal of Optimization Theory and Applications, 2023, 196 : 266 - 297