Optimization on Solution Sets of Common Fixed Point Problems (Hardcover, 1st ed. 2021)

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.

General

Imprint:	Springer Nature Switzerland AG
Country of origin:	Switzerland
Series:	Springer Optimization and Its Applications, 178
Release date:	August 2021
First published:	2021
Authors:	Alexander J Zaslavski
Dimensions:	235 x 155mm (L x W)
Format:	Hardcover
Pages:	434
Edition:	1st ed. 2021
ISBN-13:	978-3-03-078848-3
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Books > Business & Economics > Business & management > Management & management techniques > Operational research Books > Science & Mathematics > Mathematics > Optimization > General Promotions
LSN:	3-03-078848-2
Barcode:	9783030788483

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!