Alternating direction optimization algorithms for covariance completion problems

被引:0
|
作者
Zare, Armin [1 ]
Jovanovic, Mihailo R. [1 ]
Georgiou, Tryphon T. [1 ]
机构
[1] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
关键词
Alternating direction method of multipliers; alternating minimization algorithm; convex optimization; low-rank approximation; nuclear norm regularization; state covariances; structured matrix completion problems; ENERGY AMPLIFICATION; MATRIX COMPLETION; SPECTRUM; RANK;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Second-order statistics of nonlinear dynamical systems can be obtained from experiments or numerical simulations. These statistics are relevant in understanding the fundamental physics, e. g., of fluid flows, and are useful for developing low-complexity models. Such models can be used for the purpose of control design and analysis. In many applications, only certain second-order statistics of a limited number of states are available. Thus, it is of interest to complete partially specified covariance matrices in a way that is consistent with the linearized dynamics. The dynamics impose structural constraints on admissible forcing correlations and state statistics. Solutions to such completion problems can be used to obtain stochastically driven linearized models. Herein, we address the covariance completion problem. We introduce an optimization criterion that combines the nuclear norm together with an entropy functional. The two, together, provide a numerically stable and scalable computational approach which is aimed at low complexity structures for stochastic forcing that can account for the observed statistics. We develop customized algorithms based on alternating direction methods that are well-suited for large scale problems.
引用
收藏
页码:515 / 520
页数:6
相关论文
共 50 条
  • [1] ALTERNATING DIRECTION ALGORITHMS FOR l1-PROBLEMS IN COMPRESSIVE SENSING
    Yang, Junfeng
    Zhang, Yin
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2011, 33 (01): : 250 - 278
  • [2] Alternating Direction Method for Covariance Selection Models
    Xiaoming Yuan
    [J]. Journal of Scientific Computing, 2012, 51 : 261 - 273
  • [3] Alternating Direction Method for Covariance Selection Models
    Yuan, Xiaoming
    [J]. JOURNAL OF SCIENTIFIC COMPUTING, 2012, 51 (02) : 261 - 273
  • [4] Matrix completion via an alternating direction method
    Chen, Caihua
    He, Bingsheng
    Yuan, Xiaoming
    [J]. IMA JOURNAL OF NUMERICAL ANALYSIS, 2012, 32 (01) : 227 - 245
  • [5] Structured covariance completion via proximal algorithms
    Zare, Armin
    Dhingra, Neil K.
    Jovanovic, Mihailo R.
    Georgiou, Tryphon T.
    [J]. 2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2017,
  • [6] Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems
    Gur, Eyal
    Sabach, Shoham
    Shtern, Shimrit
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2023, 48 (01) : 53 - 77
  • [7] A new alternating direction method for linearly constrained nonconvex optimization problems
    X. Y. Wang
    S. J. Li
    X. P. Kou
    Q. F. Zhang
    [J]. Journal of Global Optimization, 2015, 62 : 695 - 709
  • [8] On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems
    Magnusson, Sindri
    Weeraddana, Pradeep Chathuranga
    Rabbat, Michael G.
    Fischione, Carlo
    [J]. IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2016, 3 (03): : 296 - 309
  • [9] A new alternating direction method for linearly constrained nonconvex optimization problems
    Wang, X. Y.
    Li, S. J.
    Kou, X. P.
    Zhang, Q. F.
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2015, 62 (04) : 695 - 709
  • [10] Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization
    Zhao, Jianxi
    Feng, Qian
    Zhao, Lina
    [J]. NUMERICAL ALGORITHMS, 2019, 82 (01) : 371 - 396