Pages that link to "Item:Q842714"

The following pages link to Moments and sums of squares for polynomial optimization and related problems (Q842714):

Displaying 34 items.

• Continuous multifacility ordered median location problems (Q322399) (← links)
• Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
• Real ideal and the duality of semidefinite programming for polynomial optimization (Q351462) (← links)
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms (Q457226) (← links)
• Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
• Semidefinite programming for min-max problems and games (Q662286) (← links)
• Equilibrium problems involving the Lorentz cone (Q742123) (← links)
• A semidefinite programming approach for solving multiobjective linear programming (Q742135) (← links)
• Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
• An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
• Positive polynomials and semidefinite programming (Q948606) (← links)
• Semidefinite programming relaxations for semialgebraic problems (Q1424271) (← links)
• Chebyshev model arithmetic for factorable functions (Q1675562) (← links)
• Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621) (← links)
• On sums of squares of \(K\)-nomials (Q1979337) (← links)
• Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290) (← links)
• Tensor \(Z\)-eigenvalue complementarity problems (Q2028497) (← links)
• The truncated Hamburger moment problems with gaps in the index set (Q2032313) (← links)
• Rejoinder on: ``Distance geometry and data science'' (Q2192024) (← links)
• Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
• Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
• Spectral factorizations and sums of squares representations via semidefinite programming (Q2784372) (← links)
• Equivalence of sum of squares convex relaxations for quadratic distance problems (Q2847256) (← links)
• A complete characterization of the gap between convexity and sos-convexity (Q2848175) (← links)
• Sum of squares basis pursuit with linear and second order cone programming (Q2979646) (← links)
• A New Look at Nonnegativity on Closed Sets and Polynomial Optimization (Q3105778) (← links)
• Sums of squares and moment problems in equivariant situations (Q3605843) (← links)
• (Q4464677) (← links)
• Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel (Q5051374) (← links)
• A mixed PI/VI design method for nonlinear <i>H</i>_{<i><b>∞</b></i>} Control (Q5212481) (← links)
• Mathematical programming formulations for the alternating current optimal power flow problem (Q5918268) (← links)
• Mathematical programming formulations for the alternating current optimal power flow problem (Q5918757) (← links)
• A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (Q6081938) (← links)
• On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (Q6550977) (← links)