Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgments
- 1 Introduction
- Part I Theoretical Foundations
- 2 The Geometry Near an Intersection
- 3 Well-Posedness
- 4 Uniqueness and the Nonnegativity Constraint
- 5 Some Preliminary Conclusions
- Part II Analysis of Algorithms for Phase Retrieval
- Part III Further Properties of Hybrid Iterative Algorithms and Suggestions for Improvement
- References
- Index
5 - Some Preliminary Conclusions
from Part I - Theoretical Foundations
Published online by Cambridge University Press: 21 April 2022
Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgments
- 1 Introduction
- Part I Theoretical Foundations
- 2 The Geometry Near an Intersection
- 3 Well-Posedness
- 4 Uniqueness and the Nonnegativity Constraint
- 5 Some Preliminary Conclusions
- Part II Analysis of Algorithms for Phase Retrieval
- Part III Further Properties of Hybrid Iterative Algorithms and Suggestions for Improvement
- References
- Index
Summary
This chapter summarizes the results of the previous three chapters on the theoretical foundations for the study of the phase retrieval problem.
- Type
- Chapter
- Information
- Geometry of the Phase Retrieval ProblemGraveyard of Algorithms, pp. 103 - 106Publisher: Cambridge University PressPrint publication year: 2022