Abstract
A method to recover the unknown sparse error $e$ in a corrupted linear system $b=Ax+e$ is proposed. The original problem is first transformed into a convex optimization problem with equality constraints using the QR decomposition of $A$ . The transformed problem is then solved using 1-norm minimization. The proposed method is applied to the secure state estimation of a cyber physical system (CPS). Two different methods for solving such problems are also discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
