• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Tao Wei, Pan Zhisong, Zhu Xiaohui, Tao Qing. The Optimal Individual Convergence Rate for the Projected Subgradient Method with Linear Interpolation Operation[J]. Journal of Computer Research and Development, 2017, 54(3): 529-536. DOI: 10.7544/issn1000-1239.2017.20160155
Citation: Tao Wei, Pan Zhisong, Zhu Xiaohui, Tao Qing. The Optimal Individual Convergence Rate for the Projected Subgradient Method with Linear Interpolation Operation[J]. Journal of Computer Research and Development, 2017, 54(3): 529-536. DOI: 10.7544/issn1000-1239.2017.20160155

The Optimal Individual Convergence Rate for the Projected Subgradient Method with Linear Interpolation Operation

More Information
  • Published Date: February 28, 2017
  • The projected subgradient method is one of the simplest algorithms for solving nonsmooth constrained optimization problems. So far, only the optimal convergence rate in terms of the averaged output has been obtained. Its individual convergence rate is even regarded as an open problem. Recently, by incorporating a linear interpolation operation into the dual averaging methods, Nesterov and Shikhman achieved a quasi-monotone subgradient method for nonsmooth convex minimization, which is proved to have the optimal individual convergence rate. Unfortunately, their discussion is only limited to the dual averaging methods. This paper focuses on the individual convergence rate of projected subgradient methods. By employing the same technique, we present a projected subgradient method with linear interpolation operation. In contrast to the work of Nesterov and Shikhman, the projected subgradient method itself in the proposed method has to be modified slightly so as to ensure the individual convergence rate. We prove that the proposed method has the optimal individual convergence rate for solving nonsmooth convex problems. Further, the corresponding stochastic method is proved to have the optimal individual convergence rate. This can be viewed as an approximate answer to the open problem of optimal individual convergence of the projected subgradient methods. The experiments verify the correctness of our analysis and demonstrate the high performance of the proposed methods in real-time stabilization.
  • Cited by

    Periodical cited type(5)

    1. 彭牧尧,魏建军,王乾舟,王琨. 基于最大最小蚂蚁系统的容迟网络缓存机制. 无线电通信技术. 2023(06): 1095-1103 .
    2. 刘涛. 基于机会网络节点定位算法的优化设计. 白城师范学院学报. 2021(02): 38-42 .
    3. 刘慧,钱育蓉,张振宇,杨文忠. 机会网络中基于陌生节点的竞争转发策略. 计算机工程与设计. 2021(10): 2710-2717 .
    4. 龙浩,张书奎,张力. 一种车载机会网络文件调度与数据传输算法. 计算机应用与软件. 2020(04): 82-88 .
    5. 葛宇,梁静. 基于相遇概率时效性和重复扩散感知的机会网络消息转发算法. 计算机应用. 2020(05): 1397-1402 .

    Other cited types(3)

Catalog

    Article views (1215) PDF downloads (494) Cited by(8)
    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return