Pages that link to "Item:Q5108258"
From MaRDI portal
The following pages link to Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube (Q5108258):
Displaying 16 items.
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization (Q2044964) (← links)
- Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives (Q2052165) (← 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)
- 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)
- An effective version of Schmüdgen's Positivstellensatz for the hypercube (Q2693779) (← links)
- The impact of noise on evaluation complexity: the deterministic trust-region case (Q2696963) (← links)
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel (Q5051374) (← links)
- Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures (Q5152480) (← links)
- Algebraic Perspectives on Signomial Optimization (Q5886830) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5918420) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5925640) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
- An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials (Q6181366) (← links)
