2000 character limit reached
On the mixed monotonicity of polynomial functions (2312.15517v1)
Published 24 Dec 2023 in math.OC, cs.SY, and eess.SY
Abstract: In this paper, it is shown that every univariate polynomial function is mixed monotone globally with a polynomial decomposition function. The decomposition functions can be constructed from the Gram matrix representation of polynomial functions. The tightness of polynomial decomposition functions is discussed. 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.
- S. Coogan and M. Arçak, “Efficient finite abstraction of mixed monotone systems,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, 2015, pp. 58–67.
- S. Coogan, “Mixed monotonicity for reachability and safety in dynamical systems,” in Proceedings of the Conference on Decision and Control, Jeju, South Korea, 2020, pp. 5074–5085.
- M. Moisan and O. Bernard, “Robust interval observers for global Lipschitz uncertain chaotic systems,” Systems & Control Letters, vol. 59, pp. 687–694, 2010.
- T. Raïssi, D. Efimov, and A. Zolghadri, “Interval state estimation for a class of nonlinear systems,” IEEE Transactions on Automatic Control, vol. 57, no. 1, pp. 260–265, 2012.
- A. M. Tahir, X. Xu, and B. Açıkmeşe, “Self-triggered interval observers for Lipschitz nonlinear systems,” in Proceedings of the American Control Conference, Philadelphia, PA, 2019, pp. 465–470.
- A. M. Tahir and B. Açıkmeşe, “Synthesis of interval observers for bounded Jacobian nonlinear discrete-time systems,” IEEE Control Systems Letters, vol. 6, pp. 764–769, 2021.
- M. Khajenejad and S. Z. Yong, “ℋ∞ℋ\mathcal{H}\inftycaligraphic_H ∞-optimal interval observer synthesis for uncertain nonlinear dynamical systems via mixed-monotone decompositions,” IEEE Control Systems Letters, vol. 6, pp. 3008–3013, 2022.
- P. A. Parrilo, “Semidefinite programming relaxations for semialgebraic problems,” Mathematical Programming, vol. 96, no. 2, pp. 293–320, 2003.
- G. Chesi, “LMI techniques for optimization over polynomials in control: A survey,” IEEE Transactions on Automatic Control, vol. 55, no. 11, pp. 2500–2510, 2010.
- L. Yang, O. Mickelin, and N. Ozay, “On sufficient conditions for mixed monotonicity,” IEEE Transactions on Automatic Control, vol. 64, no. 12, pp. 5080–5085, 2019.
- L. Yang and N. Ozay, “Tight decomposition functions for mixed monotonicity,” in Proceedings of the Conference on Decision and Control, Nice, France, 2019, pp. 5318–5322.
- M. Udell, K. Mohan, D. Zeng, J. Hong, S. Diamond, and S. Boyd, “Convex optimization in Julia,” in Proceedings of the Workshop on High Performance Technical Computing in Dynamic Languages, New Orleans, LA, 2014, pp. 18–28.
- B. O’Donoghue, E. Chu, N. Parikh, and S. Boyd, “SCS: Splitting conic solver, version 3.2.3,” https://github.com/cvxgrp/scs, 2022.
- A. Alanwar, A. Koch, F. Allgöwer, and K. H. Johansson, “Data-driven reachability analysis from noisy data,” IEEE Transactions on Automatic Control, vol. 68, no. 5, pp. 3054–3069, 2023.