Weak subgradient method with path based target level algorithm for nonconvex optimization

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Communications Faculty of Sciences University Ankara Series A1 Mathematics and Statistics
Volume:71 Issue:2
Weak subgradient method with path based target level algorithm for nonconvex optimization

Weak subgradient method with path based target level algorithm for nonconvex optimization

Pages : 377-394

View : 45 | Download : 8

Publication Date : 2022-06-30

Article Type : Research Paper

Abstract :We study a new version of the weak subgradient method, recently developed by Dinc Yalcin and Kasimbeyli for solving nonsmooth, nonconvex problems. This method is based on the concept of using any weak subgradient of the objective of the problem at the currently generated point with a version of the dynamic stepsize in order to produce a new point at each iteration. The target value needed in the dynamic stepsize is defined using a path based target level insert ignore into journalissuearticles values(PBTL); algorithm to ensure the optimal value of the problem is reached. We analyze the convergence and give an estimate of the convergence rate of the proposed method. Furthermore, we demonstrate the performance of the proposed method on nonsmooth, nonconvex test problems, and give the computational results by comparing them with the approximately optimal solutions.
Keywords : Weak subgradient, nonconvex optimization, nonsmooth optimization, path based target level algoirthm

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.