Books > Business & Economics > Business & management > Management & management techniques > Operational research
|
Buy Now
Optimization on Solution Sets of Common Fixed Point Problems (Hardcover, 1st ed. 2021)
Loot Price: R3,645
Discovery Miles 36 450
|
|
Optimization on Solution Sets of Common Fixed Point Problems (Hardcover, 1st ed. 2021)
Series: Springer Optimization and Its Applications, 178
Expected to ship within 12 - 17 working days
|
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
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!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.