Pages that link to "Item:Q2968176"
From MaRDI portal
The following pages link to Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization (Q2968176):
Displaying 14 items.
- Convergence rates of moment-sum-of-squares hierarchies for optimal control problems (Q511733) (← links)
- Quadrature-based polynomial optimization (Q2191279) (← links)
- Connecting optimization with spectral analysis of tri-diagonal matrices (Q2235164) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- An effective version of Schmüdgen's Positivstellensatz for the hypercube (Q2693779) (← 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)
- Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures (Q5152480) (← links)
- Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing (Q5219701) (← links)
- Algebraic Perspectives on Signomial Optimization (Q5886830) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming (Q6155879) (← links)
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs (Q6536842) (← links)