Bernstein polynomial relaxations turn stochastic barrier function synthesis into a linear program, but are empirically slower, less accurate, and less scalable than sum-of-squares on the tested systems.
Some np-complete problems in quadratic and nonlinear programming,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On Polynomial Stochastic Barrier Functions: Bernstein Versus Sum-of-Squares
Bernstein polynomial relaxations turn stochastic barrier function synthesis into a linear program, but are empirically slower, less accurate, and less scalable than sum-of-squares on the tested systems.