Tractable approximations of sets defined with quantifiers
Jean B. Lasserre

TL;DR
This paper develops a systematic method to approximate complex semi-algebraic sets defined with quantifiers using polynomial sublevel sets, enabling practical computation for robust and optimization problems.
Contribution
It introduces a convergent sequence of explicit polynomial approximations for sets defined with quantifiers, using semidefinite programming, and extends to various related set types.
Findings
Provides a systematic procedure for inner and outer approximations
Each approximation is a polynomial sublevel set obtained via semidefinite programming
Approximations converge strongly to the target sets
Abstract
Given a compact basic semi-algebraic set , a simple set (box or ellipsoid), and some semi-algebraic function , we consider sets defined with quantifiers, of the form R_f:=\{x\in B: \mbox{f(x,y)\leq 0y(x,y)\in K}\} and D_f:=\{x\in B: \mbox{f(x,y)\geq 0y(x,y)\in K}\}. The former set is particularly useful to qualify "robust" decisions versus noise parameter (e.g. in robust optimization on some set ) whereas the latter set is useful (e.g. in optimization) when one does not want to work with its lifted representation . Assuming that for every , we provide a systematic procedure to obtain a sequence of explicit inner (resp. outer) approximations that converge to (resp. ) in a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Numerical Methods and Algorithms · Iterative Methods for Nonlinear Equations
