Kontakt
Jak kupować
Dostawa
Doradca ds. zakupów
Approximate Solutions of Common Fixed-Point Problems
Angielski
249 b
Nawet do 30 dni na zwrot
Klienci kupili także
/
Miękka
146.90
zł
/
Miękka
109.02
zł
This book presents results on the§convergence behavior of algorithms which are known as vital tools for solving§convex feasibility problems and common fixed point problems. The main goal for§us in dealing with a known computational error is to find what approximate§solution can be obtained and how many iterates one needs to find it. According§to know results, these algorithms should converge to a solution. In this§exposition, these algorithms are studied, taking into account computational§errors which remain consistent in practice. In this case the convergence to a§solution does not take place. We show that our algorithms generate a good§approximate solution if computational errors are bounded from above by a small§positive constant.§§Beginning with an introduction, this monograph moves on§to study:§§· dynamic§string-averaging methods for common fixed point problems in a Hilbert space§§· dynamic§string methods for common fixed point problems in a metric space§· dynamic§string-averaging version of the proximal algorithm§· common fixed§point problems in metric spaces§§· common fixed§point problems in the spaces with distances of the Bregman type§§· a proximal§algorithm for finding a common zero of a family of maximal monotone operators§§· subgradient§projections algorithms for convex feasibility problems in Hilbert spaces§
Informacje o książce
Angielski
Podaruj tę książkę jeszcze dziś
To łatwe
1 Dodaj książkę do koszyka i wybierz „dostarczyć jako prezent” 2 W odpowiedzi wyślemy Ci bon 3 Książka dotrze na adres obdarowanegoMogłoby Cię także zainteresować
/
Twarda
486.79
zł
/
Miękka
119.36
zł
/
Miękka
70.94
zł
/
Miękka
44.52
zł
/
Twarda
667.28
zł
Cześć! Jestem Libroamiko, Twój doradca książkowy.
Jak mogę Ci pomóc?