On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications

DOI10.1137/110857751zbMath1272.14042arXiv1112.0544OpenAlexW2964089478MaRDI QIDQ5300525

Gabriela Jeronimo, Daniel Perrucci, Elias P. Tsigaridas

Publication date: 27 June 2013

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.0544

zbMATH Keywords

polynomial optimizationseparation bounds

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Semialgebraic sets and related spaces (14P10)

Related Items (11)

Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ The complexity of subdivision for diameter-distance tests ⋮ Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization ⋮ RAC-Drawability is ∃ℝ-complete and Related Results ⋮ A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set ⋮ Divide and conquer roadmap for algebraic sets ⋮ Fixed points, Nash equilibria, and the existential theory of the reals ⋮ Complexity, exactness, and rationality in polynomial optimization ⋮ Complexity, exactness, and rationality in polynomial optimization ⋮ Exponential convexifying of polynomials ⋮ Computing real witness points of positive dimensional polynomial systems

This page was built for publication: On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications