Computing the nearest scattering passive system

arXiv:2501.11903 · math.OC, cs.NA, cs.SY, eess.SY, math.NA · Submitted 2025-01-21 · Read on arXiv

math.OC, cs.NA, cs.SY, eess.SY, math.NA

Submitted: 2025-01-21

Updated: 2026-09-20

Comments: 22 pages, code, experiments and data available from https://gitlab.com/ngillis/nearestBRsysPHform. Accepted in The Electronic Journal of Linear Algebra

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Accuracy — 4× in this paper · explained in 1 episode
• Objective Function — 4× in this paper · explained in 2 episodes
• System Identification — 2× in this paper · explained in 3 episodes
• Alternating Direction Method of Multipliers (ADMM) — 1× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Semidefinite Programming (SDP) — 1× in this paper · explained in 3 episodes

Sources

• Numerical methods to compute a minimal realization of a port-Hamiltonian system
• KLAP: KYP lemma based low-rank approximation for $\mathcal{H}_2$-optimal passivation

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Second-Order Optimization with Asynchronous Curvature
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability