The following pages link to (Q4496025):
Displaying 50 items.
- Sparse sums of squares on finite abelian groups and improved semidefinite lifts (Q344935) (← links)
- Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions (Q373942) (← links)
- Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming (Q378749) (← links)
- Robust control of uncertain systems: classical results and recent developments (Q458745) (← links)
- Modeling probability densities with sums of exponentials via polynomial approximation (Q495127) (← links)
- On reduced semidefinite programs for second order moment bounds with applications (Q507337) (← links)
- Semidefinite relaxations of dynamical programs under discrete constraints (Q601981) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- Motion planning for flat systems using positive B-splines: an LMI approach (Q608434) (← links)
- Discriminants and nonnegative polynomials (Q655567) (← links)
- Optimal switching between cash-flow streams (Q684138) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Smaller SDP for SOS decomposition (Q746820) (← links)
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares (Q816068) (← links)
- Independent sets in semi-random hypergraphs (Q832900) (← links)
- Semidefinite representations for finite varieties (Q868441) (← links)
- On global optimizations with polynomials (Q928299) (← links)
- Certificates of positivity in the Bernstein basis (Q938310) (← links)
- Exact relaxations of non-convex variational problems (Q941046) (← links)
- Exactness of sums of squares relaxations involving \(3\times 3\) matrices and Lorentz cones (Q996334) (← links)
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares (Q1030710) (← links)
- Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- Global optimization in Hilbert space (Q1717227) (← links)
- Distributionally robust expectation inequalities for structured distributions (Q1717228) (← links)
- Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
- Global optimization of polynomials over real algebraic sets (Q1730308) (← links)
- Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
- A survey of adjustable robust optimization (Q1740490) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- Symmetry groups, semidefinite programs, and sums of squares (Q1878418) (← links)
- Finite Blaschke products with prescribed critical points, Stieltjes polynomials, and moment problems (Q1999819) (← links)
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
- A disintegration of the Christoffel function (Q2080947) (← links)
- Semi-definite representations for sets of cubics on the two-dimensional sphere (Q2093290) (← links)
- Optimal scenario-dependent multivariate shortfall risk measure and its application in risk capital allocation (Q2106746) (← links)
- Heat transport bounds for a truncated model of Rayleigh-Bénard convection via polynomial optimization (Q2116300) (← links)
- Extremal cubics on the circle and the 2-sphere (Q2136157) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- Numerical optimization and positivity certificates for polynomials and rationals over simplices (Q2151616) (← links)
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds (Q2156369) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- Bounds-constrained polynomial approximation using the Bernstein basis (Q2168063) (← links)
- Mean estimation with sub-Gaussian rates in polynomial time (Q2196216) (← links)
- Set propagation in dynamical systems with generalised polynomial algebra and its computational complexity (Q2206505) (← links)
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation (Q2231643) (← links)
- A convex optimization method to solve a filter design problem (Q2252696) (← links)
- On types of degenerate critical points of real polynomial functions (Q2284966) (← links)
- Regularized nonlinear acceleration (Q2288185) (← links)
- An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions (Q2351490) (← links)
