Pages that link to "Item:Q5219701"
From MaRDI portal
The following pages link to Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing (Q5219701):
Displaying 10 items.
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization (Q2044964) (← links)
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere (Q2144547) (← links)
- Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets (Q2144552) (← links)
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives (Q2156386) (← links)
- Distributionally robust optimization with polynomial densities: theory, models and algorithms (Q2189441) (← links)
- Quadrature-based polynomial optimization (Q2191279) (← links)
- Connecting optimization with spectral analysis of tri-diagonal matrices (Q2235164) (← links)
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis (Q3296188) (← links)
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel (Q5051374) (← links)
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube (Q5108258) (← links)
