Noch Fragen? 0800 / 33 82 637

Optimization on Solution Sets of Common Fixed Point Problems

Produktform: E-Buch Text Elektronisches Buch in proprietärem

This book is devoted to a detailed study of the subgradient projection method and its variants for convex optimization problems over the solution sets of common fixed point problems and convex feasibility problems. These optimization problems are investigated to determine good solutions obtained by different versions of the subgradient projection algorithm in the presence of sufficiently small computational errors.  The use of selected algorithms is highlighted including the Cimmino type subgradient, the iterative subgradient, and the dynamic string-averaging subgradient.  All results presented are new.  Optimization problems where the underlying constraints are the solution sets of other problems, frequently occur in applied mathematics. The reader should not miss the section in Chapter 1 which considers some examples arising in the real world applications. The problems discussed have an important impact in optimization theory as well. The book will be useful for researches interested in the optimization theory and its applications. weiterlesen

Dieser Artikel gehört zu den folgenden Serien

Elektronisches Format: PDF

Sprache(n): Englisch

ISBN: 978-3-030-78849-0 / 978-3030788490 / 9783030788490

Verlag: Springer International Publishing

Erscheinungsdatum: 09.08.2021

Seiten: 434

Autor(en): Alexander J. Zaslavski

139,09 € inkl. MwSt.
Recommended Retail Price
kostenloser Versand

lieferbar - Lieferzeit 10-15 Werktage

zurück