Abstract
Consider a discrete-time linear time-invariant descriptor system Ex(k+1)=Ax(k) for k∈Z+. In this paper, we tackle for the first time the problem of stabilizing such systems by computing a nearby regular index one stable system Eˆx(k+1)=Aˆx(k) with rank(Eˆ)=r. We reformulate this highly nonconvex problem into an equivalent optimization problem with a relatively simple feasible set onto which it is easy to project. This allows us to employ a block coordinate descent method to obtain a nearby regular index one stable system. We illustrate the effectiveness of the algorithm on several examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
