Weak subgradient method for solving nonsmooth nonconvex optimization problems

2020 
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 on...
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    49
    References
    1
    Citations
    NaN
    KQI
    []