Home
»
Sparse Polynomial Optimization: Theory And Practice
Sparse Polynomial Optimization: Theory And Practice
Regular price
€92.99
596 verified reviews
100% verified
Delivery/Collection within 10-20 working days
Shipping & Delivery
Shipping & Delivery
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
10-20 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Close
A01=Jie Wang
A01=Victor Magron
Author_Jie Wang
Author_Victor Magron
Category=PBU
Correlative Sparsity
Deep Learning
EigenvalueTrace Optimization
eq_isMigrated=1
eq_nobargain
Moment-SOS Hierarchy
Optimal Power Flow
Polynomial Optimization
Quantum Information
Semidefinite Programming
Sparsity Pattern
Sum of Squares
Term Sparsity
Product details
- ISBN 9781800612945
- Publication Date: 05 Jun 2023
- Publisher: World Scientific Europe Ltd
- Publication City/Country: GB
- Product Form: Hardback
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 to solve 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.
Sparse Polynomial Optimization: Theory And Practice
€92.99
