Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights - researchr publication

researchr

You are not signed in
Sign in
Sign up

Spyros A. Reveliotis, Ahmed Nazeem. Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights. SIAM J. Control and Optimization, 51(2):1707-1726, 2013. [doi]

Abstract is missing.

runs on WebDSL