A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem
We introduce a heuristic rule for calculating the stepsize in the subgradient method for unconstrained convex nonsmooth optimization which, unlike the classic approach, is based on retaining some information from previous iteration. The rule is inspired by the well known two-point stepsize by Barzil...
Сохранить в:
| Главные авторы: | , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Elsevier
2024-01-01
|
| Серии: | EURO Journal on Computational Optimization |
| Предметы: | |
| Online-ссылка: | http://www.sciencedirect.com/science/article/pii/S2192440624000091 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|