Electrical and Electronic Engineering - Research Publications

Permanent URI for this collection

http://hdl.handle.net/11343/362

Filters

2018 - 2020 2
Reset filters

Settings
Statistics
Citations
Author: Lin, Yankai × Author: Shames, Iman × Start date: 2017 × Type: Conference Paper ×

Search Results

Now showing 1 - 2 of 2
  • Item
    Thumbnail Image
    Secure Control of Nonlinear Systems Using Semi-Homomorphic Encryption
    Lin, Y ; Farokhi, F ; Shames, I ; Nesic, D (IEEE, 2018-01-01)
    A secure nonlinear networked control system (NCS) design using semi-homomorphic encryption, namely, Paillier encryption is studied. Under certain assumptions, control signal computation using encrypted signal directly is allowed by semi-homomorphic encryption. Thus, the security of the NCSs is further enhanced by concealing information on the controller side. However, additional technical difficulties in the design and analysis of NCSs are induced compared to standard NCSs. In this paper, the stabilization of a nonlinear discrete time NCS is considered. More specifically, sufficient conditions on the encryption parameters that guarantee stability of the NCS are provided, and a trade-off between the encryption parameters and the ultimate bound of the state is shown.
  • Item
    Thumbnail Image
    Asynchronous Distributed Optimization via Dual Decomposition and Block Coordinate Ascent
    Lin, Y ; Shames, I ; Nesic, D (IEEE, 2020-03-12)
    We study a class of distributed optimization problems of minimizing the sum of potentially non-differentiable convex objective functions (without requiring strong convexity). A novel approach to the analysis of asynchronous distributed optimization is developed. An iterative algorithm based on dual decomposition and block coordinate ascent is implemented in an edge based manner. We extend available results in the literature by allowing multiple and potentially overlapping blocks to be updated at the same time with non-uniform probabilities assigned to different blocks. Sublinear convergence with probability one is proved for the algorithm under the aforementioned weak assumptions. A numerical example is provided to illustrate the effectiveness of the algorithm.