system identification

Hankel Matrix Rank Minimization with Applications to System Identification and Realization

  • Maryam Fazel
  • Ting Kei Pong
  • Defeng Sun
  • Paul Tseng
    • Categories Applications - Science and Engineering, Convex and Nonsmooth Optimization, Linear, Cone and Semidefinite Programming Tags , , , , ,

    We introduce a flexible optimization framework for nuclear norm minimization of matrices with linear structure, including Hankel, Toeplitz and moment structures, and catalog applications from diverse fields under this framework. We discuss various first-order methods for solving the resulting optimization problem, including alternating direction methods of multipliers, proximal point algorithms and gradient projection methods. We … Read more

    Linear System Identification via Atomic Norm Regularization

  • Badri Narayan Bhaskar
  • Benjamin Recht
  • Parikshit Shah
  • Gongguo Tang
    • Categories Control Applications, Convex Optimization Tags , , ,

    This paper proposes a new algorithm for linear system identification from noisy measurements. The proposed algorithm balances a data fidelity term with a norm induced by the set of single pole filters. We pose a convex optimization problem that approximately solves the atomic norm minimization problem and identifies the unknown system from noisy linear measurements. … Read more

    Convergence and Convergence Rate of Stochastic Gradient Search in the Case of Multiple and Non-Isolated Extrema

  • Vladislav B. Tadic
    • Categories Control Applications, Stochastic Programming Tags , , , , ,

    The asymptotic behavior of stochastic gradient algorithms is studied. Relying on some results of differential geometry (Lojasiewicz gradient inequality), the almost sure point-convergence is demonstrated and relatively tight almost sure bounds on the convergence rate are derived. In sharp contrast to all existing result of this kind, the asymptotic results obtained here do not require … Read more

    Convergence Rate of Stochastic Gradient Search in the Case of Multiple and Non-Isolated Minima

  • Vladislav B. Tadic
    • Categories Control Applications, Statistics, Stochastic Programming Tags , , , , , , , ,

    The convergence rate of stochastic gradient search is analyzed in this paper. Using arguments based on differential geometry and Lojasiewicz inequalities, tight bounds on the convergence rate of general stochastic gradient algorithms are derived. As opposed to the existing results, the results presented in this paper allow the objective function to have multiple, non-isolated minima, … Read more