The following pages link to (Q2978415):
Displaying 25 items.
- Robust control of uncertain systems: classical results and recent developments (Q458745) (← links)
- Positive polynomials and semidefinite programming (Q948606) (← links)
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
- On sums of squares of \(K\)-nomials (Q1979337) (← links)
- Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290) (← links)
- Quadratic optimization with switching variables: the convex hull for \(n=2\) (Q2044962) (← links)
- Analysis of optimization algorithms via sum-of-squares (Q2046552) (← links)
- Finding unstable periodic orbits: a hybrid approach with polynomial optimization (Q2077605) (← links)
- Sum-of-squares chordal decomposition of polynomial matrix inequalities (Q2689814) (← links)
- A Complete Characterization of the Gap between Convexity and SOS-Convexity (Q2848175) (← links)
- (Q4557933) (← links)
- Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming (Q4632034) (← links)
- Symmetry Adapted Gram Spectrahedra (Q4987609) (← links)
- Rational quartic spectrahedra (Q4989914) (← links)
- Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems (Q5045170) (← links)
- Bounding extrema over global attractors using polynomial optimisation (Q5130916) (← links)
- Minimum wave speeds in monostable reaction–diffusion equations: sharp bounds by polynomial optimization (Q5161096) (← links)
- Safe nonlinear control design for input constrained polynomial systems using sum-of-squares programming (Q5165345) (← links)
- Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs (Q5376453) (← links)
- Convex computation of maximal Lyapunov exponents (Q6048912) (← links)
- Auxiliary functions as Koopman observables: data-driven analysis of dynamical systems via polynomial optimization (Q6066022) (← links)
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695) (← links)
- A study of the double pendulum using polynomial optimization (Q6557701) (← links)
- Global minimization of polynomial integral functionals (Q6573176) (← links)
- Quantile-constrained Wasserstein projections for robust interpretability of numerical and machine learning models (Q6595779) (← links)
