Pages that link to "Item:Q2884280"
From MaRDI portal
The following pages link to Polynomial matrix inequality and semidefinite representation (Q2884280):
Displaying 15 items.
- Free semidefinite representation of matrix power functions (Q471947) (← links)
- Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
- Convergent conic linear programming relaxations for cone convex polynomial programs (Q1728215) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
- Convex Hulls of Quadratically Parameterized Sets With Quadratic Constraints (Q2849467) (← links)
- A Matrix Positivstellensatz with Lifting Polynomials (Q5210520) (← links)
- Dehomogenization for completely positive tensors (Q6107957) (← links)
- Rational Generalized Nash Equilibrium Problems (Q6116245) (← links)
- Generalized truncated moment problems with unbounded sets (Q6159298) (← links)
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)
- Finite convergence of moment-SOS relaxations with nonreal radical ideals (Q6622756) (← links)
