PirateBay Download | zaslavski optimization solution sets point problems 2021

zaslavski optimization solution sets point problems 2021

Type:: E-books
Files:: 1
Size:: 4.0 MB
Uploaded On:: June 4, 2022, 9:26 a.m.
Added By:: andryold1
Seeders:: 0
Leechers:: 1
Info Hash:: 9A2AE6EF61377F71F4A346D05D07F6BD53D45392

Textbook in PDF format 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. Introduction Fixed Point Subgradient Algorithm Proximal Point Subgradient Algorithm Cimmino Subgradient Projection Algorithm Iterative Subgradient Projection Algorithm Dynamic String-Averaging Subgradient Projection Algorithm Fixed Point Gradient Projection Algorithm Cimmino Gradient Projection Algorithm A Class of Nonsmooth Convex Optimization Problems Zero-Sum Games with Two Players

Get This Torrent

Zaslavski A. Optimization on Solution Sets...Point Problems 2021.pdf 4.0 MB

Details for: Zaslavski A. Optimization on Solution Sets...Point Problems 2021

zaslavski optimization solution sets point problems 2021