Abstract
We discuss informally two approaches to solving convex and nonconvex feasibility problems – via entropy optimization and via algebraic iterative methods. We shall highlight the advantages and disadvantages of each and give various related applications and limiting examples. While some of the results are very classical, they are not as well-known to practitioners as they should be. A key role is played by the Fenchel conjugate.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
