Contacto
Como comprar
Entrega
Guia de compras
Approximate Solutions of Common Fixed-Point Problems
Inglês
263 b
Até 30 dias para devoluções
Os clientes também compraram
/
Capa mole
35.97
€
/
Capa mole
25.22
€
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§
Sobre o livro
Inglês
Ofereça este livro hoje
É fácil
1 Adicione ao carrinho e escolha Entregar como presente ao finalizar a compra 2 Receberá um vale 3 O livro chegará ao endereço do destinatárioTambém pode estar interessado em
/
Livro de capa dura
112.79
€
/
Capa mole
30.90
€
/
Capa mole
21.78
€
/
Capa mole
15.60
€
/
Capa mole
9.72
€
/
Livro de capa dura
154.64
€
Olá! Sou o Libroamiko, o seu conselheiro de livros.
Como posso ajudar?