English

Tangencies and Polynomial Optimization

Optimization and Control 2019-03-12 v2

Abstract

Given a polynomial function f ⁣:RnRf \colon \mathbb{R}^n \rightarrow \mathbb{R} and a unbounded basic closed semi-algebraic set SRn,S \subset \mathbb{R}^n, in this paper we show that the conditions listed below are characterized exactly in terms of the so-called {\em tangency variety} of ff on SS: (i) The ff is bounded from below on S;S; (ii) The ff attains its infimum on S;S; (iii) The sublevel set {xS  f(x)λ}\{x \in S \ | \ f(x) \le \lambda\} for λR\lambda \in \mathbb{R} is compact; (iv) The ff is coercive on S.S. Besides, we also provide some stability criteria for boundedness and coercivity of ff on S.S.

Keywords

Cite

@article{arxiv.1902.06041,
  title  = {Tangencies and Polynomial Optimization},
  author = {Tien-Son Pham},
  journal= {arXiv preprint arXiv:1902.06041},
  year   = {2019}
}

Comments

a minor change in the introduction

R2 v1 2026-06-23T07:42:30.673Z