- Tytuł:
- Selection strategies in projection methods for convex minimization problems
- Autorzy:
-
Cegielski, Andrzej
Dylewski, Robert - Powiązania:
- https://bibliotekanauki.pl/articles/729560.pdf
- Data publikacji:
- 2002
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
convex minimization
projection method
long steps
residual selection
obtuse cone selection - Opis:
- We propose new projection method for nonsmooth convex minimization problems. We present some method of subgradient selection, which is based on the so called residual selection model and is a generalization of the so called obtuse cone model. We also present numerical results for some test problems and compare these results with some other convex nonsmooth minimization methods. The numerical results show that the presented selection strategies ensure long steps and lead to an essential acceleration of the convergence of projection methods.
- Źródło:
-
Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2002, 22, 1; 97-123
1509-9407 - Pojawia się w:
- Discussiones Mathematicae, Differential Inclusions, Control and Optimization
- Dostawca treści:
- Biblioteka Nauki
Artykuł