Solving Problems with Projections
close menu
Bookswagon
search
My Account
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Mathematics and Science books > Physics > Mathematical physics > Solving Problems with Projections: From Phase Retrieval to Packing
Solving Problems with Projections: From Phase Retrieval to Packing

Solving Problems with Projections: From Phase Retrieval to Packing


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

It is a curious fact that even notoriously difficult computational problems can be expressed in the form of a high-dimensional Venn diagram, where solutions lie in the overlap of a pair of remarkably simple sets, A and B. The simplicity of these sets enables operations called projections that locate the nearest point of A, or B, starting anywhere within the high-dimensional space.  This book introduces a novel method for tackling complex problems that exploits projections and the two-set structure, offering an effective alternative to traditional, gradient-based approaches. Beginning with phase retrieval, where A and B address the properties of an image and its Fourier transform, it progresses to more diverse challenges, such as sphere packing, origami design, sudoku and tiling puzzles, data dimension reduction, and neural network training. The text presents a detailed description of this powerful and original approach and is essential reading for physicists and applied mathematicians.

Table of Contents:
1. Origins; 2. Bipartisanship; 3. Conspiracy theory; 4. Projections; 5. Reflect-reflect-relax; 6. The user's guide; 7. Divide and concur; 8. Your turn; Notes; References; Index.

Review :
'Veit Elser's groundbreaking work on phase retrieval fundamentally altered the course of my research, directing it toward the study of the celebrated Douglas-Rachford algorithm, particularly in challenging scenarios where problems are nonconvex or without solutions. His book, Solving Problems with Projections, is poised to transform many lives. It masterfully combines cutting-edge research, textbook clarity, and engaging historical anecdotes. Elser's lucid and thought-provoking writing style will engage students, researchers, and projection enthusiasts alike. He generously shares his deep, implementable insights into his innovative Reflect-Reflect-Relax and Divide-and-Concur algorithms, empowering readers to find solutions for tough problems. This book is a brilliant, indispensable, compelling, and highly enjoyable read for anyone passionate about mathematics, physics, and the art of problem-solving.' Heinz Bauschke, SIAM Fellow and Professor of Mathematics, The University of British Columbia, Canada 'The book starts with an algorithm for phase retrieval–loosely, the problem of recovering entries of some arrays of complex numbers only knowing their absolute values. It is a variant of von Neumann's idea of alternating projections back and forth between sets A and B in a high-dimensional space, which incorporates potential for chaotic behavior. The subtlety and power of this idea leads to a fantastic tour through a wide range of increasingly demanding problems, including sudoku, geometry ('kissing spheres,' NP-hard tiling questions), Boolean satisfiability, quantum state tomography, mixed-integer linear programming, and neural network convergence. The choice of how the problem is set up can require cleverness, and this book is a grand 'User's Guide' to using these powerful and creative techniques, and it is filled with engaging and useful exercises that cover a broad spectrum of difficulty and application areas.' Joe Buhler, University of Minnesota, USA 'Elser's book is a tour-de-force, full of clever and original ideas for solving a wide variety of practical problems and entertaining puzzles. The arc of the book mirrors the general method presented, as new insights are successively revealed, until the reader has reached ultimate enlightenment. Extensive exercises challenge and engage the reader, to foster an understanding of how to implement these powerful algorithms. If you are a computer scientist, physicist, or applied mathematician, you should read this book!' Jonathan Yedidia, Senior Director of AI Research, Analog Devices, Boston, USA 'Reader! There are algorithms undreamt of in your philosophy. They project and reflect, divide and concur. They solve Sudoku, help spheres kiss, and see the shapes of proteins without a microscope. They are simple yet chaotic, they work really well, and you need to learn about them! Be prepared: Veit Elser will teach you to think about problems and solutions in a beautiful new way.' Cris Moore, Santa Fe Institute, USA


Best Sellers


Product Details
  • ISBN-13: 9781009475556
  • Publisher: Cambridge University Press
  • Publisher Imprint: Cambridge University Press
  • Language: English
  • ISBN-10: 100947555X
  • Publisher Date: 04 Jun 2025
  • Binding: Digital download and online
  • Sub Title: From Phase Retrieval to Packing


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Solving Problems with Projections: From Phase Retrieval to Packing
Cambridge University Press -
Solving Problems with Projections: From Phase Retrieval to Packing
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Solving Problems with Projections: From Phase Retrieval to Packing

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!