Convergence rates for sums-of-squares hierarchies with correlative sparsity
This work derives upper bounds on the convergence rate of the moment-sum-of-squares
hierarchy with correlative sparsity for global minimization of polynomials on compact basic …
hierarchy with correlative sparsity for global minimization of polynomials on compact basic …
[HTML][HTML] Peak estimation of rational systems using convex optimization
This paper presents algorithms that upper-bound the peak value of a state function along
trajectories of a continuous-time system with rational dynamics. The finite-dimensional but …
trajectories of a continuous-time system with rational dynamics. The finite-dimensional but …
Computational complexity of sum-of-squares bounds for copositive programs
In recent years, copositive programming has received significant attention for its ability to
model hard problems in both discrete and continuous optimization. Several relaxations of …
model hard problems in both discrete and continuous optimization. Several relaxations of …
Learning quantum Hamiltonians at any temperature in polynomial time with Chebyshev and bit complexity
We consider the problem of learning local quantum Hamiltonians given copies of their Gibbs
state at a known inverse temperature, following Haah et al.[2108.04842] and Bakshi et …
state at a known inverse temperature, following Haah et al.[2108.04842] and Bakshi et …
Convergence rates for sums-of-squares hierarchies with correlative sparsity
RA Rios Zertuche Rios Zertuche, M Korda, V Magron - 2024 - munin.uit.no
This work derives upper bounds on the convergence rate of the moment-sum-of-squares
hierarchy with correlative sparsity for global minimization of polynomials on compact basic …
hierarchy with correlative sparsity for global minimization of polynomials on compact basic …