Structured covariance completion via proximal algorithms

被引:0
|
作者
Zare, Armin [1 ]
Dhingra, Neil K. [2 ]
Jovanovic, Mihailo R. [1 ]
Georgiou, Tryphon T. [3 ]
机构
[1] Univ Southern Calif, Dept Elect Engn, Los Angeles, CA 90089 USA
[2] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
[3] Univ Calif Irvine, Dept Mech & Aerosp Engn, Irvine, CA 92697 USA
基金
美国国家科学基金会;
关键词
Convex optimization; method of multipliers; proximal augmented Lagrangian; proximal methods; state co-variances; structured matrix completion; ENERGY AMPLIFICATION; STATE COVARIANCES;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper studies the interplay between dynamics and statistics of a stochastically driven dynamical system. Motivation is provided by applications in fluid flow modeling and control. In this context, second-order statistics around the mean velocity profile can be obtained, for a subset of variables, from experiments or numerical simulations. The basic idea is to determine a parsimonious perturbation of the generator of the linearized Navier-Stokes equations, together with directions of excitation sources, that can account for the observed statistics. This covariance completion problem is to determine minimum energy and low-rank perturbation of the linearized dynamics to reconcile them with the partially available second-order statistics - such models are valuable as tools for analysis and control purposes. The resulting optimization problem can be cast as a convex semidefinite program (SDP). However, general-purpose SDP solvers cannot handle typical problem-sizes that are of interest in fluid flows. We develop customized algorithms that allow handling such covariance completion problems for substantially larger scales. These algorithms exploit the structure of the problem and utilize the method of multipliers and the proximal augmented Lagrangian method.
引用
收藏
页数:6
相关论文
共 50 条
  • [1] Alternating direction optimization algorithms for covariance completion problems
    Zare, Armin
    Jovanovic, Mihailo R.
    Georgiou, Tryphon T.
    2015 AMERICAN CONTROL CONFERENCE (ACC), 2015, : 515 - 520
  • [2] Clutter Edges Detection Algorithms for Structured Clutter Covariance Matrices
    Wang, Tianqi
    Xu, Da
    Hao, Chengpeng
    Addabbo, Pia
    Orlando, Danilo
    IEEE SIGNAL PROCESSING LETTERS, 2022, 29 : 642 - 646
  • [3] Sparse MIMO Radar via Structured Matrix Completion
    Chi, Yuejie
    2013 IEEE GLOBAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING (GLOBALSIP), 2013, : 321 - 324
  • [4] THE COMPLETION OF COVARIANCE KERNELS
    Waghmare, Kartik G.
    Panaretos, Victor M.
    ANNALS OF STATISTICS, 2022, 50 (06): : 3281 - 3306
  • [5] Heterogeneous Domain Adaptation via Covariance Structured Feature Translators
    Ren, Chuan-Xian
    Feng, Jiashi
    Dai, Dao-Qing
    Yan, Shuicheng
    IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (04) : 2166 - 2177
  • [6] Discrete-Aware Matrix Completion via Proximal Gradient
    Iimori, Hiroki
    de Abreu, Giuseppe Thadeu Freitas
    Taghizadeh, Omid
    Ishibashi, Koji
    2020 54TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2020, : 1327 - 1332
  • [7] Robust Spectral Compressed Sensing via Structured Matrix Completion
    Chen, Yuxin
    Chi, Yuejie
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (10) : 6576 - 6601
  • [8] Matrix Completion in the Unit Hypercube via Structured Matrix Factorization
    Bugliarello, Emanuele
    Jain, Swayambhoo
    Rakesh, Vineeth
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 2038 - 2044
  • [9] Matrix completion with capped nuclear norm via majorized proximal minimization
    Kuang, Shenfen
    Chao, Hongyang
    Li, Qia
    NEUROCOMPUTING, 2018, 316 : 190 - 201
  • [10] MATRIX COMPLETION OF NOISY GRAPH SIGNALS VIA PROXIMAL GRADIENT MINIMIZATION
    Gimenez-Febrer, Pere
    Pages-Zamora, Alba
    2017 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2017, : 4441 - 4445