Optimization on Solution Sets of Common Fixed Point Problems (Springer Optimization and Its Applications, 178)
Alexander J. Zaslavski
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.
年:
2021
出版社:
Springer
言語:
english
ページ:
445
ISBN 10:
3030788482
ISBN 13:
9783030788483
ファイル:
PDF, 2.58 MB
IPFS:
,
english, 2021
この書籍は、著作権所有者のクレームによりダウンロードできません。
Beware of he who would deny you access to information, for in his heart he dreams himself your master
ファイル拡張子変換機能
検索結果をもっと見る
その他多くの特典 
