On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods

DOI10.1016/J.SYSCONLE.2023.105578MaRDI QIDQ6137809zbMATH OpenFDO

Authors Yuan Zhang, Yuanqing Xia, Yufeng Zhan

Publication date 4 September 2023

Published in Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2201.01112

zbMATH Keywords

computational complexitystability radiusaffine structurecontrollability radiusconvex-relaxation

Mathematics Subject Classification ID

Controllability (93B05) Perturbations in control/observation systems (93C73) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05)

Abstract: This paper addresses the real structured controllability, stabilizability, and stability radii (RSCR, RSSZR, and RSSR, respectively) of linear systems, which involve determining the distance (in terms of matrix norms) between a (possibly large-scale) system and its nearest uncontrollable, unstabilizable, and unstable systems, respectively, with a prescribed affine structure. This paper makes two main contributions. First, by demonstrating that determining the feasibilities of RSCR and RSSZR is NP-hard when the perturbations have a general affine parameterization, we prove that computing these radii is NP-hard. Additionally, we prove the NP-hardness of a problem related to the RSSR. These hardness results are independent of the matrix norm used. Second, we develop unified rank-relaxation based algorithms for these problems, which can handle both the Frobenius norm and the $2$-norm based problems and share the same framework for the RSCR, RSSZR, and RSSR problems. These algorithms utilize the low-rank structure of the original problems and relax the corresponding rank constraints with a regularized truncated nuclear norm term. Moreover, a modified version of these algorithms can find local optima with performance specifications on the perturbations, under appropriate conditions. Finally, simulations suggest that the proposed methods, despite being in a simple framework, can find local optima as good as several existing methods.

Recommendations

• Approximating the real structured stability radius with Frobenius-norm bounded perturbations
• Real Controllability/Stabilizability Radius of LTI Systems
• Controllability radius of linear systems under structured perturbations
• The structured controllability radii of higher order systems
• Controllability radii of linear systems with constrained controls under structured perturbations
• Estimates of the real structured radius of stability of linear dynamic systems
• Computation of the Real Controllability Radius and Minimum-Norm Perturbations of Higher-Order, Descriptor, and Time-Delay LTI Systems
• Radius of approximate controllability of linear retarded systems under structured perturbations
• Controllability radii and stabilizability radii of time-invariant linear systems
• The structured controllability radii of higher order descriptor systems

Cites work

• scientific article; zbMATH DE number 1001726 (Why is no real title available?)
• scientific article; zbMATH DE number 4207939 (Why is no real title available?)
• scientific article; zbMATH DE number 3711820 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 934504 (Why is no real title available?)
• scientific article; zbMATH DE number 967081 (Why is no real title available?)
• A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
• A formula for computation of the real stability radius
• A new approach for calculating the real stability radius
• A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its \(L_{\infty}\)-norm
• A unified convergence analysis of block successive minimization methods for nonsmooth optimization
• Between controllable and uncontrollable
• Characterization of the subdifferential of some matrix norms
• Checking robust nonsingularity is NP-hard
• Computational Complexity
• Computing the distance to an uncontrollable system
• Computing the radius of controllability for state space systems
• Fast Methods for Estimating the Distance to Uncontrollability
• New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
• On the computation of the real Hurwitz-stability radius
• On the real stability radius of sparse systems
• On the structured distance to uncontrollability
• Properties of numerical algorithms related to computing controllability
• Real Controllability/Stabilizability Radius of LTI Systems
• Several NP-hard problems arising in robust stability analysis
• Stability radius for structured perturbations and the algebraic Riccati equation
• Structural Controllability of an NDS With LFT Parameterized Subsystems
• Structural controllability and matrix nets†
• Structural controllability of networked relative coupling systems
• Structurally controllable and structurally canonical systems
• The Concave-Convex Procedure
• The Observability Radius of Networks
• The Structured Distance to the Nearest System Without Property $\mathcal {P}$

Cited in

(1)

• Real Controllability/Stabilizability Radius of LTI Systems

This page was built for publication: On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137809)