KI-Beratung Beta

Produktbild: Optimization on Solution Sets of Common Fixed Point Problems
Band 178 - 11%

Optimization on Solution Sets of Common Fixed Point Problems

11% sparen

131,99 € UVP 149,79 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

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...

Beschreibung

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.

Rezension

“Author … make accessible a number of topics that are not often found in many books. … All the algorithms are clearly explained and presented. The results presented in this book will be useful for problems with complicated sets of feasible points arising in engineering, computed tomography and radiation therapy planning. Overall, this book is an excellent contribution to the field of optimization, and it is highly recommended to the students and researchers interested in optimization theory and its applications.” (Samir Kumar Neogy, zbMATH 1479.49001, 2022)

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

11.08.2022

Abbildungen

XI, 434 p.

Verlag Springer

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

11.08.2022

Abbildungen

XI, 434 p.

Verlag Springer
Seitenzahl

434

Maße (L/B/H)

23,5/15,5/2,5 cm

Gewicht

674 g

Auflage

22001 Auflage 1st ed. 2021

Sprache

Englisch

ISBN

978-3-030-78851-3

Herstelleradresse

Springer-Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Optimization on Solution Sets of Common Fixed Point Problems
  • Preface.- Introduction.- Fixed Point Subgradient Algorithm.- Proximal Point Subgradient Algorithm.-  Cimmino Subgradient Projection Algorithm.- Iterative Subgradient Projection Algorithm.- Dynamic Strong-Averaging Subgradient Algorithm.- Fixed Point Gradient Projection Algorithm.- Cimmino Gradient Projection Algorithm.- A Class of Nonsmooth Convex Optimization Problems.- Zero-Sum Games with Two Players.- References.- Index.