# On Polynomial Optimization over Non-compact Semi-algebraic Sets

arXiv: https://arxiv.org/abs/1304.4552 · HTML: https://mlsanity.com/paper/1304.4552/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 Apr 2013.

## Built on by (most cited first, 1 of 1)

- [On Approximate Computation of Critical Points](https://mlsanity.com/paper/2601.21917/) (2026)

## Abstract (arXiv)

We consider the class of polynomial optimization problems inf f(x):x∈ K for which the quadratic module generated by the polynomials that define K and the polynomial c-f (for some scalar c) is Archimedean. For such problems, the optimal value can be approximated as closely as desired by solving a hierarchy of semidefinite programs and the convergence is finite generically. Moreover, the Archimedean condition (as well as a sufficient coercivity condition) can also be checked numerically by solving a similar hierarchy of semidefinite programs. In other words, under reasonable assumptions the now standard hierarchy of SDP-relaxations extends to the non-compact case via a suitable modification.