Iterative optimization in inverse problems
Author(s)
Bibliographic Information
Iterative optimization in inverse problems
(Monographs and research notes in mathematics)(A Chapman & Hall book)
CRC Press, c2014
Available at 9 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
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
BYR||3||1200032345204
Note
Includes bibliographical references (p. 259-275) and index
Description and Table of Contents
Description
Iterative Optimization in Inverse Problems brings together a number of important iterative algorithms for medical imaging, optimization, and statistical estimation. It incorporates recent work that has not appeared in other books and draws on the author's considerable research in the field, including his recently developed class of SUMMA algorithms. Related to sequential unconstrained minimization methods, the SUMMA class includes a wide range of iterative algorithms well known to researchers in various areas, such as statistics and image processing.
Organizing the topics from general to more specific, the book first gives an overview of sequential optimization, the subclasses of auxiliary-function methods, and the SUMMA algorithms. The next three chapters present particular examples in more detail, including barrier- and penalty-function methods, proximal minimization, and forward-backward splitting. The author also focuses on fixed-point algorithms for operators on Euclidean space and then extends the discussion to include distance measures other than the usual Euclidean distance. In the final chapters, specific problems illustrate the use of iterative methods previously discussed. Most chapters contain exercises that introduce new ideas and make the book suitable for self-study.
Unifying a variety of seemingly disparate algorithms, the book shows how to derive new properties of algorithms by comparing known properties of other algorithms. This unifying approach also helps researchers-from statisticians working on parameter estimation to image scientists processing scanning data to mathematicians involved in theoretical and applied optimization-discover useful related algorithms in areas outside of their expertise.
Table of Contents
Background. Sequential Optimization. Barrier-Function and Penalty-Function Methods. Proximal Minimization. The Forward-Backward Splitting Algorithm. Operators. Averaged and Paracontractive Operators. Convex Feasibility and Related Problems. Eigenvalue Bounds. Jacobi and Gauss-Seidel Methods. The SMART and EMML Algorithms. Alternating Minimization. The EM Algorithm. Geometric Programming and the MART. Variational Inequality Problems and Algorithms. Set-Valued Functions in Optimization. Fenchel Duality. Compressed Sensing. Appendix. Bibliography. Index.
by "Nielsen BookData"