Wszystkie pola: robert control - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Projection method with level control in convex minimization
Autorzy:: Dylewski, Robert
Powiązania:: https://bibliotekanauki.pl/articles/729283.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: projection method
convex nondifferentiable minimization
level control
Opis:: We study a projection method with level control for nonsmoooth convex minimization problems. We introduce a changeable level parameter to level control. The level estimates the minimal value of the objective function and is updated in each iteration. We analyse the convergence and estimate the efficiency of this method.
Źródło:: Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2010, 30, 1; 101-120
1509-9407
Pojawia się w:: Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Numerical behavior of the method of projection onto an acute cone with level control in convex minimization
Autorzy:: Dylewski, Robert
Powiązania:: https://bibliotekanauki.pl/articles/729267.pdf
Data publikacji:: 2000
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: convex nondifferentiable minimization
projection method
subgradient method
acute cone
obtuse cone
Opis:: We present the numerical behavior of a projection method for convex minimization problems which was studied by Cegielski [1]. The method is a modification of the Polyak subgradient projection method [6] and of variable target value subgradient method of Kim, Ahn and Cho [2]. In each iteration of the method an obtuse cone is constructed. The obtuse cone is generated by a linearly independent system of subgradients. The next approximation of a solution is the projection onto a translated acute cone which is dual to the constructed obtuse cone. The target value which estimates the minimal objective value is updated in each iteration. The numerical tests for some tests problems are presented in which the method of Cegielski [1] is compared with the method of Kim, Ahn and Cho [2].
Źródło:: Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2000, 20, 2; 147-158
1509-9407
Pojawia się w:: Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja