Pages that link to "Item:Q5359122"
From MaRDI portal
The following pages link to Bound-Constrained Polynomial Optimization Using Only Elementary Calculations (Q5359122):
Displaying 11 items.
- A note on total degree polynomial optimization by Chebyshev grids (Q683923) (← links)
- Quadrature-based polynomial optimization (Q2191279) (← links)
- Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies (Q2329654) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization (Q2968176) (← links)
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis (Q3296188) (← links)
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube (Q5108258) (← 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)
- Homogenization for polynomial optimization with unbounded sets (Q6044977) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
