Sparse Polynomial Optimization

Many Applications, Including Computer Vision, Computer Arithmetic, Deep Learning, Entanglement In Quantum Information, Graph Theory And Energy Networks, Can Be Successfully Tackled Within The Framework Of Polynomial Optimization, An Emerging Field With Growing Research Efforts In The Last Two Decades. One Key Advantage Of These Techniques Is Their Ability To Model A Wide Range Of Problems Using Optimization Formulations. Polynomial Optimization Heavily Relies On The Moment-Sums Of Squares (Moment-Sos) Approach Proposed By Lasserre, Which Provides Certificates For Positive Polynomials. On The Practical Side, However, There Is ""No Free Lunch"" And Such Optimization Methods Usually Encompass Severe Scalability Issues. Fortunately, For Many Applications, Including The Ones Formerly Mentioned, We Can Look At The Problem In The Eyes And Exploit The Inherent Data Structure Arising From The Cost And Constraints Describing The Problem. This Book Presents Several Research Efforts To Resolve This Scientific Challenge With Important Computational Implications. It Provides The Development Of Alternative Optimization Schemes That Scale Well In Terms Of Computational Complexity, At Least In Some Identified Class Of Problems. It Also Features A Unified Modeling Framework To Handle A Wide Range Of Applications Involving Both Commutative And Noncommutative Variables, And Solves Concretely Large-Scale Instances. Readers Will Find A Practical Section Dedicated To The Use Of Available Open-Source Software Libraries. This Interdisciplinary Monograph Is Essential Reading For Students, Researchers And Professionals Interested In Solving Optimization Problems With Polynomial Input Data.