Quadratic optimization problems in robust beamforming (Q1824558): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q953321 |
Changed an Item |
||
Property / author | |||
Property / author: Meng Hwa Er / rank | |||
Normal rank |
Revision as of 15:42, 21 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Quadratic optimization problems in robust beamforming |
scientific article |
Statements
Quadratic optimization problems in robust beamforming (English)
0 references
1990
0 references
The paper presents a class of constrained optimization problems whereby a quadratic cost function is to be minimized with respect to a weight vector subject to an inequality quadratic constraint on the weight vector. This class of constrained optimization problems arises as a result of a motivation for designing robust antenna array processors in the field of adaptive array processing. The constrained optimization problem is first solved by using the primal-dual method. Numerical techniques are presented to reduce the computational complexity of determining the optimal Lagrange multiplier and hence the optimal weight vector. Subsequently, a set of linear constraints or at most linear plus norm constraints are developed for approximating the performance achievable with the quadratic constraint. The use of linear constraints is very attractive, since they reduce the computational burden required to determine the optimal weight vector.
0 references
approximation techniques
0 references
robust beamforming
0 references
constrained optimization
0 references
quadratic cost function
0 references
inequality quadratic constraint
0 references
robust antenna array processors
0 references
adaptive array processing
0 references