PolyAR: A Highly Parallelizable Solver For Polynomial Inequality Constraints Using Convex Abstraction Refinement
Wael Fatnassi, Yasser Shoukry

TL;DR
PolyAR is a novel, highly parallelizable solver that leverages convex relaxation and iterative refinement to efficiently handle polynomial inequality constraints in control system design.
Contribution
It introduces a new solver that combines convex relaxation with abstraction refinement, enabling scalable analysis of nonlinear polynomial constraints using parallel computation.
Findings
PolyAR outperforms Z3 and Yices in scalability on control problems.
It effectively prunes search space through iterative convex abstraction.
Demonstrated success in designing switching signals for linear systems.
Abstract
Numerical tools for constraints solving are a cornerstone to control verification problems. This is evident by the plethora of research that uses tools like linear and convex programming for the design of control systems. Nevertheless, the capability of linear and convex programming is limited and is not adequate to reason about general nonlinear polynomials constraints that arise naturally in the design of nonlinear systems. This limitation calls for new solvers that are capable of utilizing the power of linear and convex programming to reason about general multivariate polynomials. In this paper, we propose PolyAR, a highly parallelizable solver for polynomial inequality constraints. PolyAR provides several key contributions. First, it uses convex relaxations of the problem to accelerate the process of finding a solution to the set of the non-convex multivariate polynomials. Second,…
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.
