Campuses:

optimal design via regularization

Thursday, September 7, 2017 - 10:40am - 11:15am
Mihailo Jovanovic (University of Southern California)
We consider the problem of the optimal selection of a subset of available sensors or actuators in large-scale dynamical systems. By replacing a combinatorial penalty on the number of sensors or actuators with a convex sparsity-promoting term, we cast this problem as a semidefinite program (SDP). The solution of the resulting convex optimization problem is used to select sensors (actuators) in order to gracefully degrade performance relative to the optimal Kalman filter (Linear Quadratic Regulator) that uses all available sensing (actuating) capabilities.
Subscribe to RSS - optimal design via regularization