On the mixed monotonicity of polynomial functions
Optimization and Control
2026-01-21 v2 Systems and Control
Systems and Control
Abstract
In this paper, it is shown that every polynomial function is mixed monotone globally with a polynomial decomposition function. For univariate polynomials, the decomposition functions can be constructed from the Gram matrix representation of polynomial functions. The tightness of polynomial decomposition functions is discussed. Several examples are provided. An example is provided to show that polynomial decomposition functions, in addition to being global decomposition functions, can be much tighter than local decomposition functions constructed using local Jacobian bounds. Furthermore, an example is provided to demonstrate the application to reachable set over-approximation.
Cite
@article{arxiv.2312.15517,
title = {On the mixed monotonicity of polynomial functions},
author = {Adam M Tahir},
journal= {arXiv preprint arXiv:2312.15517},
year = {2026}
}