Contents

pp v-viii

Preface

pp ix-xi

Acknowledgments

pp xii-xii

1 - Introduction

pp 1-36

Part I - Theoretical Foundations

pp 37-38

2 - The Geometry Near an Intersection

pp 39-64

3 - Well-Posedness

pp 65-84

4 - Uniqueness and the Nonnegativity Constraint

pp 85-102

5 - Some Preliminary Conclusions

pp 103-106

Part II - Analysis of Algorithms for Phase Retrieval

pp 107-108

6 - Introduction to Part II

pp 109-114

7 - Algorithms for Phase Retrieval

pp 115-146

8 - The Discrete, Classical, Phase Retrieval Problem

pp 147-190

9 - Phase Retrieval with the Nonnegativity Constraint

pp 191-204

10 - Asymptotics of Hybrid Iterative Maps

pp 205-220

Part III - Further Properties of Hybrid Iterative Algorithms and Suggestions for Improvement

pp 221-222

11 - Introduction to Part III

pp 223-225

12 - Statistics of Algorithms

pp 226-248

13 - Suggestions for Improvements

pp 249-291

14 - Concluding Remarks

pp 292-296

15 - Notational Conventions

pp 297-299

References

pp 300-304

Index

pp 263-308