Papers
Topics
Authors
Recent
2000 character limit reached

$H^2$-Optimal Reduction of Positive Networks using Riemannian Augmented Lagrangian Method (2112.15389v3)

Published 31 Dec 2021 in math.OC, cs.SY, and eess.SY

Abstract: In this study, we formulate the model reduction problem of a stable and positive network system as a constrained Riemannian optimization problem with the $H2$-error objective function of the original and reduced network systems. We improve the reduction performance of the clustering-based method, which is one of the most known methods for model reduction of positive network systems, by using the output of the clustering-based method as the initial point for the proposed method. The proposed method reduces the dimension of the network system while preserving the properties of stability, positivity, and interconnection structure by applying the Riemannian augmented Lagrangian method (RALM) and deriving the Riemannian gradient of the Lagrangian. To check the efficiency of our method, we conduct a numerical experiment and compare it with the clustering-based method in the sense of $H2$-error and $H\infty$-error.

Citations (1)

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.