activity
20052009
most citedStructured Semidefinite Representation of Some Convex Sets

7 citations · 16 across the 7 of their papers we have counts for

collaborators

7 papers

math.FA2009

Positivity of Riesz Functionals and Solutions of Quadratic and Quartic Moment Problems

Lawrence Fialkow, Jiawang Nie

We employ positivity of Riesz functionals to establish representing measures (or approximate representing measures) for truncated multivariate moment sequences. For a truncated mom…

math.OC20082 cited

First Order Conditions for Semidefinite Representations of Convex Sets Defined by Rational or Singular Polynomials

Jiawang Nie

A set is called semidefinite representable or semidefinite programming (SDP) representable if it can be represented as the projection of a higher dimensional set which is represent…

math.OC20081 cited

Matrix Cubes Parametrized by Eigenvalues

Jiawang Nie, Bernd Sturmfels

An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix cube problems whose constraints are the minimum and maximum…

math.OC20087 cited

Structured Semidefinite Representation of Some Convex Sets

J. William Helton, Jiawang Nie

Linear matrix Inequalities (LMIs) have had a major impact on control but formulating a problem as an LMI is an art. Recently there is the beginnings of a theory of which problems a…

math.OC2008

Algebraic Degree of Polynomial Optimization

Jiawang Nie, Kristian Ranestad

Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomia…

math.OC20076 cited

Semidefinite Representation of Convex Sets

J. William Helton, Jiawang Nie

Let $S =\{x\in \re^n: g_1(x)\geq 0, ..., g_m(x)\geq 0\}$ be a semialgebraic set defined by multivariate polynomials . Assume is convex, compact and has nonempty interio…