Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Projection method with residual selection for linear feasibility problems

100%
Dylewski R.
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
|
2007
|
tom 27
|
nr 1
43-50
EN
We propose a new projection method for linear feasibility problems. The method is based on the so called residual selection model. We present numerical results for some test problems.
2
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Numerical behavior of the method of projection onto an acute cone with level control in convex minimization

100%
Dylewski R.
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
|
2000
|
tom 20
|
nr 2
147-158
EN
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].
3
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Projection method with level control in convex minimization

100%
Dylewski R.
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
|
2010
|
tom 30
|
nr 1
101-120
EN
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.
4
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Selection strategies in projection methods for convex minimization problems

63%
Cegielski A., Dylewski R.
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
|
2002
|
tom 22
|
nr 1
97-123
EN
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.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.