OPTIMAL REPRESENTATION MATRICES FOR SOLVING POLYNOMIAL SYSTEMS VIA LMI

It is known that LMI can be useful for solving systems of polyno- mial equations and inequalities provided that the dimensions of the null spaces of some matrices representing the systems are smaller than certain thresholds. The first contribution of this paper is to show that, unfortunately, there always exist representation matrices obtainable in the LMI optimization for which these dimensions are larger than the allowed thresholds and, consequently, the extraction mechanism of the sought solutions cannot be performed. Moreover, it is also shown that, if there exist representation matrices for which these di- mensions are smaller than the allowed thresholds, then these matrices can be arbitrarily ill-conditioned since the smallest non-zero eigenvalue can be arbitrar- ily close to zero, hence affecting the computation of the null spaces. Another contribution is to show that an upper bound to the dimension of these null spaces can be imposed in a non-conservative way by adding suitable LMIs. This allows one to obtain the null spaces with the smallest dimension via a finite sequence of feasibility tests. Moreover, the introduced LMIs also allow to avoid ill-conditioned representation matrices, if possible, by simply turning the feasible tests into suitable convex maximizations.

[1]  Graziano Chesi,et al.  An LMI-based approach for characterizing the solution set of polynomial systems , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[2]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[3]  P. Parrilo.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

[4]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

[5]  Alberto Tesi,et al.  Robust absolute stability of Lur'e control systems in parameter space , 1991, Autom..

[6]  Graziano Chesi,et al.  Characterizing the solution set of polynomial systems in terms of homogeneous forms: an LMI approach , 2003 .

[7]  A. Vicino,et al.  On convexification of some minimum distance problems , 1999, 1999 European Control Conference (ECC).

[8]  N. Bose.  Applied multidimensional systems theory , 1982 .

[9]  B. Tibken,et al.  Estimation of the domain of attraction for polynomial systems , 2005, The Fourth International Workshop on Multidimensional Systems, 2005. NDS 2005..

[10]  B. Anderson,et al.  Output feedback stabilization—Solution by algebraic geometry methods , 1977, Proceedings of the IEEE.

[11]  Hans J. Stetter,et al.  Numerical polynomial algebra , 2004 .

[12]  Dinesh Manocha,et al.  SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS , 2002 .

[13]  Graziano Chesi,et al.  Solving quadratic distance problems: an LMI-based approach , 2003, IEEE Trans. Autom. Control..

[14]  A. Morgan.  Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems , 1987 .

[15]  Anton Leykin,et al.  Parallel Homotopy Algorithms to Solve Polynomial Systems , 2006, ICMS.

[16]  Bruce Reznick,et al.  Sums of squares of real polynomials , 1995 .

[17]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[18]  B. Sturmfels.  SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS , 2002 .

[19]  David A. Cox,et al.  Using Algebraic Geometry , 1998 .