Pages that link to "Item:Q932197"

The following pages link to On the complexity of optimization over the standard simplex (Q932197):

Displaying 9 items.

• A refined error analysis for fixed-degree polynomial optimization over the simplex (Q489141) (← links)
• Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization (Q517310) (← links)
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
• Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials (Q1740149) (← links)
• Numerical optimization and positivity certificates for polynomials and rationals over simplices (Q2151616) (← links)
• Rounding on the standard simplex: regular grids for global optimization (Q2250080) (← links)
• An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131) (← links)
• A reformulation-linearization technique for optimization over simplices (Q2689826) (← links)
• A numerical approach based on Bernstein collocation method: application to differential Lyapunov and Sylvester matrix equations (Q6108248) (← links)