Polynomial Matrix Inequality and Semidefinite Representation
From MaRDI portal
Publication:2884280
DOI10.1287/moor.1110.0498zbMath1244.90180arXiv0908.0364OpenAlexW2101922712MaRDI QIDQ2884280
Publication date: 24 May 2012
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.0364
semidefinite programminglinear matrix inequalityconvex setssum of squaressemidefinite representationmatrix concavitypolynomial matrix inequality
Semidefinite programming (90C22) Convex programming (90C25) Numerical optimization and variational techniques (65K10)
Related Items (14)
Dehomogenization for completely positive tensors ⋮ Rational Generalized Nash Equilibrium Problems ⋮ NP-hardness of deciding convexity of quartic polynomials and related problems ⋮ Generalized truncated moment problems with unbounded sets ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ Semidefinite relaxations for semi-infinite polynomial programming ⋮ Free semidefinite representation of matrix power functions ⋮ Convergent conic linear programming relaxations for cone convex polynomial programs ⋮ Exact conic programming relaxations for a class of convex polynomial cone programs ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs ⋮ A Matrix Positivstellensatz with Lifting Polynomials ⋮ An approximation algorithm for the maximum spectral subgraph problem ⋮ Convex Hulls of Quadratically Parameterized Sets With Quadratic Constraints
Uses Software
This page was built for publication: Polynomial Matrix Inequality and Semidefinite Representation
