Robust SPR Synthesis for Low-Order Polynomial Segments and Interval Polynomials
Long Wang, Wensheng Yu
Abstract
We prove that, for low-order (n < 5) stable polynomial segments or interval polynomials, there always exists a fixed polynomial such that their ratio is SPR-invariant, thereby providing a rigorous proof of Anderson's claim on SPR synthesis for the fourth-order stable interval polynomials. Moreover, the relationship between SPR synthesis for low-order polynomial segments and SPR synthesis for low-order interval polynomials is also discussed.
Create a lesson
Related papers
A Network Simplex Framework For Discrete Unbalanced Optimal Transport
Gaetano Agazzotti, Antonin Chambolle, Clément W. Royer
Warm-IP: A Path-Following ADMM Warm Start for Interior-Point Quadratic Programming
Babak Aslani, Mojtaba Tefagh, Gourav Jhanwar et al.
Adaptive Variance Reduction without Knowing Oracle Smoothness
Wei Jiang, Yibo Wang, Zechao Li
Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints
Gon Buzaglo, Guy Kornowski
Geometry-Aware Multi-Objective Optimization: Norm-Constrained Oracles with Entropic Weight Updates
El Mahdi Chayti, Alireza Mirrokni, Martin Jaggi
Estimation, Sensitivity Analysis, and Optimization of Distortion Risk Measures via Simulation
Hao Cao, Jian-Qiang Hu, Jiaqiao Hu