The geometry of linearly and quadratically constrained optimization problems for signal processing and communications

被引:11
|
作者
Pezeshki, Ali [1 ]
Scharf, Louis L. [1 ,2 ]
Chong, Edwin K. P. [1 ,3 ]
机构
[1] Colorado State Univ, Dept Elect & Comp Engn, Ft Collins, CO 80523 USA
[2] Colorado State Univ, Dept Stat, Ft Collins, CO 80523 USA
[3] Colorado State Univ, Dept Math, Ft Collins, CO 80523 USA
基金
美国国家科学基金会;
关键词
Constrained minimization; Generalized sidelobe canceller; Linear and quadratic constraints; Majorization; Multi-rank beamforming; Oblique projections; Poincare's separation theorem; Precoder and equalizer design; Quadratic forms; MINIMUM; PRECODERS; DESIGN;
D O I
10.1016/j.jfranklin.2010.03.005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Constrained minimization problems considered in this paper arise in the design of beamformers for radar, sonar, and wireless communications, and in the design of precoders and equalizers for digital communications. The problem is to minimize a quadratic form under a set of linear or quadratic constraints. We present solutions to these problems and establish a connection between them. A majorization result for matrix trace and Poincare's separation theorem play key roles in establishing the connection. We show that our solutions can be formulated as generalized sidelobe cancellers (GSCs), which tie our constrained minimizations to linear minimum mean-squared error (LMMSE) estimations. We then express our solutions in terms of oblique projection matrices and establish the geometry of our constrained minimizations. (C) 2010 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:818 / 835
页数:18
相关论文
共 50 条
  • [21] On the solution of linearly constrained optimization problems by means of barrier algorithms
    Birgin, E. G.
    Gardenghi, J. L.
    Martinez, J. M.
    Santos, S. A.
    TOP, 2021, 29 (02) : 417 - 441
  • [22] On the solution of linearly constrained optimization problems by means of barrier algorithms
    E. G. Birgin
    J. L. Gardenghi
    J. M. Martínez
    S. A. Santos
    TOP, 2021, 29 : 417 - 441
  • [23] Alternating forward–backward splitting for linearly constrained optimization problems
    Cesare Molinari
    Juan Peypouquet
    Fernando Roldan
    Optimization Letters, 2020, 14 : 1071 - 1088
  • [24] Interplay of non-convex quadratically constrained problems with adjustable robust optimization
    Bomze, Immanuel
    Gabl, Markus
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2021, 93 (01) : 115 - 151
  • [25] A note on the convergence of ADMM for linearly constrained convex optimization problems
    Liang Chen
    Defeng Sun
    Kim-Chuan Toh
    Computational Optimization and Applications, 2017, 66 : 327 - 343
  • [26] GLOBAL OPTIMIZATION ALGORITHMS FOR LINEARLY CONSTRAINED INDEFINITE QUADRATIC PROBLEMS
    PARDALOS, PM
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1991, 21 (6-7) : 87 - 97
  • [27] A derivative-free algorithm for linearly constrained optimization problems
    Gumma, E. A. E.
    Hashim, M. H. A.
    Ali, M. Montaz
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2014, 57 (03) : 599 - 621
  • [28] A derivative-free algorithm for linearly constrained optimization problems
    E. A. E. Gumma
    M. H. A. Hashim
    M. Montaz Ali
    Computational Optimization and Applications, 2014, 57 : 599 - 621
  • [29] Inverse optimization for linearly constrained convex separable programming problems
    Zhang, Jianzhong
    Xu, Chengxian
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (03) : 671 - 679
  • [30] A Tutorial on Clique Problems in Communications and Signal Processing
    Douik, Ahmed
    Dahrouj, Hayssam
    Al-Naffouri, Tareq Y.
    Alouini, Mohamed-Slim
    PROCEEDINGS OF THE IEEE, 2020, 108 (04) : 583 - 608