Parallel optimization : theory, algorithms, and applications
Author(s)
Bibliographic Information
Parallel optimization : theory, algorithms, and applications
(Numerical mathematics and scientific computation)
Oxford University Press, 1997
Available at 26 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. 481-526) and index
Description and Table of Contents
Description
This book offers a unique pathway to methods of parallel optimization by introducing parallel computing ideas and techniques into both optimization theory, and into some numerical algorithms for large-scale optimization problems. The presentation is based on the recent understanding that rigorous mathematical analysis of algorithms, parallel computing techniques, and "hands-on" experimental work on real-world problems must go hand in hand in order to achieve the
greatest advantage from novel parallel computing architectures. The three parts of the book thus bring together relevant theory, careful study of algorithms, and modelling of significant real world problems. The problem domains include: image reconstruction, radiation therapy treatment planning,
transportation problems, portfolilo management, and matrix estimation. This text can be used both as a reference for researchers and as a text for advanced graduate courses.
Table of Contents
- Foreword
- Preface
- Glossary of Symbols
- 1. Introduction
- Part I Theory
- 2. Generalized Distances and Generalized Projections
- 3. Proximal Minimization with D-Functions
- Part II Algorithms
- 4. Penalty Methods, Barrier Methods and Augmented Lagrangians
- 5. Iterative Methods for Convex Feasibility Problems
- 6. Iterative Algorithms for Linearly Constrained Optimization Problems
- 7. Model Decomposition Algorithms
- 8. Decompositions in Interior Point Algorithms
- Part III Applications
- 9. Matrix Estimation Problems
- 10. Image Reconsturction from Projections
- 11. The Inverse Problem in Radiation Therapy Treatment Planning
- 12. Multicommodity Network Flow Problems
- 13. Planning Under Uncertainty
- 14. Decompositions for Parallel Computing
- 15. Numerical Investigations
by "Nielsen BookData"