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 条
  • [31] Linearly constrained adaptive algorithms for line-frequency signal processing
    Vainio, O
    Proceedings of the IEEE-ISIE 2004, Vols 1 and 2, 2004, : 491 - 494
  • [32] Accelerating convergence of branch-and-bound algorithms for quadratically constrained optimization problems
    VanVoorhis, T
    AlKhayyal, F
    STATE OF THE ART IN GLOBAL OPTIMIZATION: COMPUTATIONAL METHODS AND APPLICATIONS, 1996, 7 : 267 - 284
  • [33] Solving quadratically constrained convex optimization problems with an interior-point method
    Meszaros, Csaba
    OPTIMIZATION METHODS & SOFTWARE, 2011, 26 (03): : 421 - 429
  • [34] Linearly and Quadratically Constrained Least-Squares Decoder for Signal-Dependent Binaural Rendering of Ambisonic Signals
    Schoerkhuber, Christian
    Hoeldrich, Robert
    2019 AES INTERNATIONAL CONFERENCE ON IMMERSIVE AND INTERACTIVE AUDIO, 2019,
  • [35] An introduction to convex optimization for communications and signal processing
    Luo, Zhi-Quan
    Yu, Wei
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2006, 24 (08) : 1426 - 1438
  • [36] GRADIENT PROJECTION FOR LINEARLY CONSTRAINED CONVEX OPTIMIZATION IN SPARSE SIGNAL RECOVERY
    Harmany, Zachary
    Thompson, Daniel
    Willett, Rebecca
    Marcia, Roummel F.
    2010 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, 2010, : 3361 - 3364
  • [37] On multiparametric/explicit NMPC for Quadratically Constrained Problems
    Diangelakis, Nikolaos A.
    Pappas, Iosif S.
    Pistikopoulos, Efstratios N.
    IFAC PAPERSONLINE, 2018, 51 (20): : 400 - 405
  • [38] AN ACTIVE SET METHOD FOR SOLVING LINEARLY CONSTRAINED NONSMOOTH OPTIMIZATION PROBLEMS
    PANIER, ER
    MATHEMATICAL PROGRAMMING, 1987, 37 (03) : 269 - 292
  • [39] On the numerical treatment of linearly constrained semi-infinite optimization problems
    Leon, T
    Sanmatias, S
    Vercher, E
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 121 (01) : 78 - 91
  • [40] A Global Optimization Algorithm for Solving Linearly Constrained Quadratic Fractional Problems
    Xu, Zhijun
    Zhou, Jing
    MATHEMATICS, 2021, 9 (22)