My Account Log in

1 option

Optimization on solution sets of common fixed point problems / Alexander J. Zaslavski.

Springer Nature - Springer Mathematics and Statistics eBooks 2021 English International Available online

View online
Format:
Book
Author/Creator:
Zaslavski, Alexander J., author.
Series:
Springer optimization and its applications ; Volume 178.
Springer Optimization and Its Applications ; Volume 178
Language:
English
Subjects (All):
Mathematical optimization.
Fixed point theory.
Physical Description:
1 online resource (XI, 434 p.)
Edition:
1st ed. 2021.
Place of Publication:
Cham, Switzerland : Springer, [2021]
System Details:
Mode of access: World Wide Web.
Summary:
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.
Contents:
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.
Notes:
Includes bibliographical references and index.
Description based on print version record.
ISBN:
3-030-78849-0

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account