Algorithms for Solving Common Fixed Point Problems
This book details approximate solutions to common fixed point problems and convex feasibility problems in the presence of perturbations. Convex feasibility problems search for a common point of a finite collection of subsets in a Hilbert space; common fix
- PDF / 3,101,195 Bytes
- 320 Pages / 439.42 x 683.15 pts Page_size
- 95 Downloads / 262 Views
Alexander J. Zaslavski
Algorithms for Solving Common Fixed Point Problems
Springer Optimization and Its Applications Volume 132 Managing Editor Panos M. Pardalos, University of Florida Editor-Combinatorial Optimization Ding-Zhu Du, University of Texas at Dallas Advisory Board J. Birge, University of Chicago S. Butenko, Texas A&M University F. Giannessi, University of Pisa S. Rebennack, Karlsruhe Institute of Technology T. Terlaky, Lehigh University Y. Ye, Stanford University
Aims and Scope Optimization has been expanding in all directions at an astonishing rate during the last few decades. New algorithmic and theoretical techniques have been developed, the diffusion into other disciplines has proceeded at a rapid pace, and our knowledge of all aspects of the field has grown even more profound. At the same time, one of the most striking trends in optimization is the constantly increasing emphasis on the interdisciplinary nature of the field. Optimization has been a basic tool in all areas of applied mathematics, engineering, medicine, economics and other sciences. The series Springer Optimization and Its Applications publishes undergraduate and graduate textbooks, monographs and state-of-the-art expository works that focus on algorithms for solving optimization problems and also study applications involving such problems. Some of the topics covered include nonlinear optimization (convex and nonconvex), network flow problems, stochastic optimization, optimal control, discrete optimization, multi-objective programming, description of software packages, approximation techniques and heuristic approaches.
More information about this series at http://www.springer.com/series/7393
Alexander J. Zaslavski
Algorithms for Solving Common Fixed Point Problems
123
Alexander J. Zaslavski Department of Mathematics Technion:Israel Institute of Technology Haifa, Israel
ISSN 1931-6828 ISSN 1931-6836 (electronic) Springer Optimization and Its Applications ISBN 978-3-319-77436-7 ISBN 978-3-319-77437-4 (eBook) https://doi.org/10.1007/978-3-319-77437-4 Library of Congress Control Number: 2018935405 Mathematics Subject Classification: 47H05, 47H09, 47H10, 47H14 © Springer International Publishing AG, part of Springer Nature 2018 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the a
Data Loading...
