Part I. Theoretical Foundations: 1. The geometry near an intersection; 2. Well posedness; 3. Uniqueness and the non-negativity constraint; 4. Some preliminary conclusions; Part II. Analysis of Algorithms for Phase Retrieval: 6. Introduction to Part II; 7. Algorithms for Phase Retrieval; 8. Discrete classical phase retrieval; 9. The non-negativity constraint; 10. Asymptotics of hybrid iterative maps; Part III. Further Properties of Hybrid Iterative Algorithms and Suggestions for Improvement: 11. Introduction to Part III; 12. Statistics of algorithms; 13. Suggestions for improvements; 14. Concluding Remarks; 15. Notational conventions.