Weak subgradient method for solving nonsmooth nonconvex optimization problems

被引:6
|
作者
Yalcin, Gulcin Dinc [1 ]
Kasimbeyli, Refail [1 ]
机构
[1] Eskisehir Tech Univ, Dept Ind Engn, Fac Engn, Eskisehir, Turkey
关键词
Subgradient; weak subgradient; nonconvex optimization; nonsmooth optimization; nonlinear optimization; solution method; GRADIENT SAMPLING ALGORITHM; MEMORY BUNDLE METHOD; CONVEX-OPTIMIZATION; RADIAL EPIDERIVATIVES; PROJECTION METHODS; CONVERGENCE; APPROXIMATE; EFFICIENCY; STEP;
D O I
10.1080/02331934.2020.1745205
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents a weak subgradient based method for solving nonconvex optimization problems. The method uses a weak subgradient of the objective function at a current point to generate a new one at every iteration. The concept of the weak subgradient is based on the idea of using supporting cones to the graph of a function under consideration which replaces in some sense the supporting hyperplanes used for subgradient notion of convex analysis. Because of this reason, the method developed in this paper does not require convexity assumption neither on the objective function nor on the set of feasible solutions. The new method is similar to subgradient methods of convex analysis and can be considered as a generalization of those methods. The paper investigates different stepsize parameters and provides convergence theorems for all cases. The significant difficulty of subgradient methods is an estimation of subgradients at every iteration. In this paper, a method for estimating the weak subgradients is also presented. The new method is tested on well-known test problems from the literature and computational results are reported and interpreted.
引用
收藏
页码:1513 / 1553
页数:41
相关论文
共 50 条
  • [1] Subgradient Method for Nonconvex Nonsmooth Optimization
    A. M. Bagirov
    L. Jin
    N. Karmitsa
    A. Al Nuaimat
    N. Sultanova
    Journal of Optimization Theory and Applications, 2013, 157 : 416 - 435
  • [2] Subgradient Method for Nonconvex Nonsmooth Optimization
    Bagirov, A. M.
    Jin, L.
    Karmitsa, N.
    Al Nuaimat, A.
    Sultanova, N.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2013, 157 (02) : 416 - 435
  • [3] PROXIMALLY GUIDED STOCHASTIC SUBGRADIENT METHOD FOR NONSMOOTH, NONCONVEX PROBLEMS
    Davis, Damek
    Grimmer, Benjamin
    SIAM JOURNAL ON OPTIMIZATION, 2019, 29 (03) : 1908 - 1930
  • [4] A STOCHASTIC SUBGRADIENT METHOD FOR NONSMOOTH NONCONVEX MULTILEVEL COMPOSITION OPTIMIZATION
    Ruszczynski, Andrzej
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2021, 59 (03) : 2301 - 2320
  • [5] A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
    Long, Xian Jun
    Wang, Xiao Ting
    Li, Gao Xi
    Li, Geng Hua
    APPLIED NUMERICAL MATHEMATICS, 2024, 202 : 209 - 221
  • [6] Subgradient-Based Neural Networks for Nonsmooth Nonconvex Optimization Problems
    Bian, Wei
    Xue, Xiaoping
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 2009, 20 (06): : 1024 - 1038
  • [7] Stochastic subgradient algorithm for nonsmooth nonconvex optimization
    Gulcin Dinc Yalcin
    Journal of Applied Mathematics and Computing, 2024, 70 : 317 - 334
  • [8] Stochastic subgradient algorithm for nonsmooth nonconvex optimization
    Yalcin, Gulcin Dinc
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2024, 70 (01) : 317 - 334
  • [9] Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
    Andrzej Ruszczyński
    Optimization Letters, 2020, 14 : 1615 - 1625
  • [10] Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
    Ruszczynski, Andrzej
    OPTIMIZATION LETTERS, 2020, 14 (07) : 1615 - 1625