Abstract
Optimization is a vibrant growing area of Applied Mathematics. Its many successful applications depend on efficient algorithms and this has pushed the development of theory and software. In recent years there has been a resurgence of interest to use “non-standard” techniques to estimate the complexity of computation and to guide algorithm design. New interactions with fields like algebraic geometry, representation theory, number theory, combinatorial topology, algebraic combinatorics, and convex analysis have contributed non-trivially to the foundations of computational optimization. In this expository survey we give three example areas of optimization where “algebraic-geometric thinking” has been successful. One key point is that these new tools are suitable for studying models that use non-linear constraints together with combinatorial conditions.
Sign-in/Register to access full text options 
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 callMore From: Jahresbericht der Deutschen Mathematiker-Vereinigung
Disclaimer: 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.
