Springer Optimization and Its Applications

Optimization on Solution Sets of Common Fixed Point Problems

Authors: Zaslavski, Alexander J.

Free Preview
  • Studies the influence of computational errors on minimization problems with a convex objective function on a common fixed point set of a finite family of quasi-nonexpansive mappings
  • Highlights the use of Cimmino type subgradient algorithms
  • Highlights the use of the iterative subgradient algorithms
  • Highlights the use of the dynamic string-averaging subgradient algorithm
see more benefits

Buy this book

eBook 96,29 €
price for Spain (gross)
  • ISBN 978-3-030-78849-0
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 124,79 €
price for Spain (gross)
  • ISBN 978-3-030-78848-3
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
  • The final prices may differ from the prices shown due to specifics of VAT rules
About this book

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.

About the authors

​Alexander J. Zaslavski is professor in the Department of Mathematics, Technion-Israel Institute of Technology, Haifa, Israel. He has authored numerous books with Springer, the most recent of which include Turnpike Theory for the Robinson–Solow–Srinivasan Model (978-3-030-60306-9),  The Projected Subgradient Algorithm in Convex Optimization (978-3-030-60299-4),  Convex Optimization with Computational Errors (978-3-030-37821-9), Turnpike Conditions in Infinite Dimensional Optimal Control (978-3-030-20177-7).

Table of contents (10 chapters)

Table of contents (10 chapters)

Buy this book

eBook 96,29 €
price for Spain (gross)
  • ISBN 978-3-030-78849-0
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 124,79 €
price for Spain (gross)
  • ISBN 978-3-030-78848-3
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Services for this Book

Bibliographic Information

Bibliographic Information
Book Title
Optimization on Solution Sets of Common Fixed Point Problems
Authors
Series Title
Springer Optimization and Its Applications
Series Volume
178
Copyright
2021
Publisher
Springer International Publishing
Copyright Holder
The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
eBook ISBN
978-3-030-78849-0
DOI
10.1007/978-3-030-78849-0
Hardcover ISBN
978-3-030-78848-3
Series ISSN
1931-6828
Edition Number
1
Number of Pages
XI, 434
Topics