Frequency-Domain Identification of Discrete-Time Systems using Sum-of-Rational Optimization (2312.15722v1)
Abstract: We propose a computationally tractable method for the identification of stable canonical discrete-time rational transfer function models, using frequency domain data. The problem is formulated as a global non-convex optimization problem whose objective function is the sum of weighted squared residuals at each observed frequency datapoint. Stability is enforced using a polynomial matrix inequality constraint. The problem is solved globally by a moment-sum-of-squares hierarchy of semidefinite programs through a framework for sum-of-rational-functions optimization. Convergence of the moment-sum-of-squares program is guaranteed as the bound on the degree of the sum-of-squares polynomials approaches infinity. The performance of the proposed method is demonstrated using numerical simulation examples.
- Frequency-Domain System Identification using Sum-of-Rational Optimization. Technical report, ETHz. 10.3929/ethz-b-000646581.
- ApS, M. (2023). The MOSEK optimization toolbox for MATLAB manual. Version 10.1.
- Minimizing the sum of many rational functions. Mathematical Programming Computation, 8(1), 83–111.
- Solution of the truncated complex moment problem for flat data, volume 568. American Mathematical Soc.
- Solving the sum-of-ratios problem by an interior-point method. Journal of Global Optimization, 19(1), 83–102.
- Convergent relaxations of polynomial matrix inequalities and static output feedback. IEEE Transactions on Automatic Control, 51(2), 192–202. 10.1109/TAC.2005.863494.
- GloptiPoly: Global Optimization over Polynomials with Matlab and SeDuMi. ACM Transactions on Mathematical Software (TOMS), 29(2), 165–194.
- Detecting global optimality and extracting solutions in gloptipoly. In Positive polynomials in control, 293–310. Springer.
- Inner approximations for polynomial matrix inequalities and robust stability regions. IEEE Transactions on Automatic Control, 57(6), 1456–1467.
- Lasserre, J.B. (2009). Moments, Positive Polynomials And Their Applications. Imperial College Press Optimization Series. World Scientific Publishing Company.
- Ljung, L. (1999). System Identification: Theory for the User. Prentice Hall information and system sciences series. Prentice Hall PTR.
- Löfberg, J. (2004). YALMIP : a toolbox for modeling and optimization in MATLAB. In ICRA (IEEE Cat. No.04CH37508), 284–289.
- JuMP 1.0: Recent improvements to a modeling language for mathematical optimization. Mathematical Programming Computation.
- System identification: a frequency domain approach. John Wiley & Sons.
- Toward Tractable Global Solutions to Bayesian Point Estimation Problems via Sparse Sum-of-Squares Relaxations. In 2020 American Control Conference (ACC), 1501–1506.
- Toward Tractable Global Solutions to Maximum-Likelihood Estimation Problems via Sparse Sum-of-Squares Relaxations. In 2019 IEEE 58th Conference on Decision and Control (CDC), 3184–3189.
- Fractional programming: The sum-of-ratios case. Optimization Methods and Software, 18(2), 219–229.
- Vuillemin, P. (2014). Frequency-limited model approximation of large-scale dynamical models. Ph.D. thesis, ISAE-Institut Supérieur de l’Aéronautique et de l’Espace.
- CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization. ACM Transactions on Mathematical Software, 48(4), 1–26.
- On gradient-based search for multivariable system estimates. IEEE Transactions on Automatic Control, 53(1), 298–306.