8 citations · 17 across the 7 of their papers we have counts for
9 papers
Sample Complexity for Evaluating the Robust Linear Observers Performance under Coprime Factors Uncertainty
Yifei Zhang, Sourav Kumar Ukil, Andrei Sperila +1
This paper addresses the end-to-end sample complexity bound for learning in closed loop the state estimator-based robust H2 controller for an unknown (possibly unstable) Linear Tim…
Sparse Representations of Dynamical Networks: A Coprime Factorization Approach
Şerban Sabău, Andrei Sperilă, Cristian Oară +1
We study a class of dynamical networks modeled by linear and time-invariant systems which are described by state-space realizations. For these networks, we investigate the relation…
Network Realization Functions for Optimal Distributed Control
Şerban Sabău, Andrei Sperilă, Cristian Oară +1
In this paper, we discuss a distributed control architecture, aimed at networks with linear and time-invariant dynamics, which is amenable to convex formulations for controller des…
Sample Complexity of the Robust LQG Regulator with Coprime Factors Uncertainty
Yifei Zhang, Sourav Kumar Ukil, Ephraim Neimand +2
This paper addresses the end-to-end sample complexity bound for learning the H2 optimal controller (the Linear Quadratic Gaussian (LQG) problem) with unknown dynamics, for potentia…
A Parallel Linear-Constraint Active Set Method
E. Dov Neimand, Serban Sabau
We present two parallel optimization algorithms for a convex function . The first algorithm optimizes over linear inequality constraints in a Hilbert space, , and the…
Distributed Control of Descriptor Networks: A Convex Procedure for Augmented Sparsity
Andrei Sperilă, Cristian Oară, Bogdan D. Ciubotaru +1
For networks of systems, with possibly improper transfer function matrices, we present a design framework which enables control, while imposing sparsity constr…