Optimizing Lyapunov Certificates via Stability-Preserving Quadratization for Polynomial Systems
Abstract
Region-of-attraction (ROA) certificates for polynomial systems become expensive as state dimension and degree grow: direct sum-of-squares (SOS) formulations require combinatorially growing monomial bases. Quadratization represents a polynomial vector field exactly on an invariant manifold of a quadratic system, allowing a quadratic Lyapunov function to certify the ROA. For a fixed lift, stabilizer gains shape the off-manifold extension and transverse dynamics, while representation gauges change the matrix representation but not the vector field. Both affect the spectral-norm certificate, yet prior work fixes the gain by a feasibility heuristic before optimizing the gauge. We formulate optimal dissipative quadratization (ODQ), jointly designing gains and gauges for a fixed monomial lift, reference extension, stabilizer factorization, and Lyapunov weight Q=I. Gains lie in a prescribed compact Hurwitz box. At each gain, an exact semidefinite program globally minimizes the spectral-norm bound over the gauge. Residual-aware bounds yield a certified closed Lyapunov sublevel set, accounting for the floating-point Lyapunov residual. Under our stated assumptions, every accumulation point of the idealized outer search is box-Clarke stationary. A finite run returns the best independently verified candidate; global optimality of the gain search is not claimed. On a planar quintic, optimizing the gain increases the certified area by a factor of $2.238$ over a matched zero-gain gauge. Across 16 heterogeneous polynomial systems with stabilizer freedom, ODQ improves on both fixed-gain lifted baselines. All 36 ODQ runs on the relay benchmark complete, and all 27 repeat-level comparisons across nine fully paired cases favor ODQ over an SOS baseline with a fixed quadratic Lyapunov function in both the fixed-direction proxy and construction time. Broader comparisons with direct SOS methods remain mixed.
Related
- Optimizing Explicit Unit-Distance Lower-Bound Certificates
- Algebraic Expressivity Certificates for Shallow Polynomial Neural Networks
- Stability Transfer for Autonomous Systems via Higher-Order Taylor-Truncated Lyapunov Certificates
- Iterative graph lifting for automatic design of path-complete stability certificates
- Data-to-Certificates (D2C): Koopman Supereigenfunctions for Stability, Safety, and Control
BibTeX
@misc{cai2026optimizing,
title = {{Optimizing Lyapunov Certificates via Stability-Preserving Quadratization for Polynomial Systems}},
author = {Yubo Cai and Gioele Zardini},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.18871},
eprint = {2609.18871},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.18871},
}
RIS
TY - UNPB
TI - Optimizing Lyapunov Certificates via Stability-Preserving Quadratization for Polynomial Systems
AU - Yubo Cai
AU - Gioele Zardini
PY - 2026
DA - 2026/09/16
PB - arXiv
DO - 10.48550/arxiv.2609.18871
UR - https://arxiv.org/abs/2609.18871
AB - Region-of-attraction (ROA) certificates for polynomial systems become expensive as state dimension and degree grow: direct sum-of-squares (SOS) formulations require combinatorially growing monomial bases. Quadratization represents a polynomial vector field exactly on an invariant manifold of a quadratic system, allowing a quadratic Lyapunov function to certify the ROA. For a fixed lift, stabilizer gains shape the off-manifold extension and transverse dynamics, while representation gauges change the matrix representation but not the vector field. Both affect the spectral-norm certificate, yet prior work fixes the gain by a feasibility heuristic before optimizing the gauge. We formulate optimal dissipative quadratization (ODQ), jointly designing gains and gauges for a fixed monomial lift, reference extension, stabilizer factorization, and Lyapunov weight Q=I. Gains lie in a prescribed compact Hurwitz box. At each gain, an exact semidefinite program globally minimizes the spectral-norm bound over the gauge. Residual-aware bounds yield a certified closed Lyapunov sublevel set, accounting for the floating-point Lyapunov residual. Under our stated assumptions, every accumulation point of the idealized outer search is box-Clarke stationary. A finite run returns the best independently verified candidate; global optimality of the gain search is not claimed. On a planar quintic, optimizing the gain increases the certified area by a factor of $2.238$ over a matched zero-gain gauge. Across 16 heterogeneous polynomial systems with stabilizer freedom, ODQ improves on both fixed-gain lifted baselines. All 36 ODQ runs on the relay benchmark complete, and all 27 repeat-level comparisons across nine fully paired cases favor ODQ over an SOS baseline with a fixed quadratic Lyapunov function in both the fixed-direction proxy and construction time. Broader comparisons with direct SOS methods remain mixed.
ER -