Abstract
In the area of broad-band antenna array signal processing, the global minimum of a quadratic equality constrained quadratic cost minimization problem is often required. The problem posed is usually characterized by a large optimization space (around 50–90 tuples), a large number of linear equality constraints, and a few quadratic equality constraints each having very low rank quadratic constraint matrices. Two main difficulties arise in this class of problem. Firstly, the feasibility region is nonconvex and multiple local minima abound. This makes conventional numerical search techniques unattractive as they are unable to locate the global optimum consistently (unless a finite search area is specified). Secondly, the large optimization space makes the use of decision-method algorithms for the theory of the reals unattractive. This is because these algorithms involve the solution of the roots of univariate polynomials of order to the square of the optimization space. In this paper we present a new algorithm which exploits the structure of the constraints to reduce the optimization space to a more manageable size. The new algorithm relies on linear-algebra concepts, basic optimization theory, and a multivariate polynomial root-solving tool often used by decision-method algorithms.
Similar content being viewed by others
References
S. P. Applebaum and D. J. Chapman, Adaptive Arrays with Main Beam Constraints, IEEE Trans. Antennas and Propagation, vol. 24, Sept. 1976, pp. 650–662.
A. Booker and C. Y. Ong, Multiple-Constraint Adaptive Filtering, Geophysics, vol. 36, June 1971, pp. 498–509.
A. E. Bryson, Jr., and Y. C. Ho, Applied Optimal Control, Blaisdell, Waltham, MA, May 1969.
B. Buchberger, An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal (in German), Ph.D. Thesis, Math. Inst., University of Innsbruck, 1965.
B. Buchberger, A Survey on the Method of Groebner Bases for Solving Problems in Connection with Systems of Multivariate Polynomials, Symbolic and Algebraic Computation by Computers (N. Inada and T. Soma, editors), World Scientific, Singapore, 1985, pp. 69–83.
B. Buchberger, Groebner Bases: An Algorithmic Method in Polynomial Ideal Theory, Multidimensional Systems Theory (N. K. Bose, editor), Reidel, Dordrecht, 1985.
J. Canny, A New Algebraic Method for Motion Planning and Real Geometry, Proc. IEEE Symp. FOCS, Los Angeles, CA, 1987, pp. 39–48.
J. F. Canny, Generalized Characteristic Polynomials,J. Symbolic Comput., vol. 9, 1990, pp. 241–250.
A. Cantoni and M. C. Blasikiewicz, Derivative Constrained Broad Band Antenna Array Processors Revisited, IASTED 2nd Internat. Symp. on Signal Processing and Its Applications, Gold Coast, Queensland, Aug. 1990, pp. 319–326.
H. Cox, Resolving Powers and Sensitivity to Mismatch of Optimum Array Processors, J. Acoust. Soc. Amer., 54, no. 3, September 1973, pp. 771–785.
M. H. Er and A. Cantoni, Techniques in Robust Broad Band Beamforming, Control and Dynamic Systems, (C. T. Leondes editor), Academic Press, San Diego, CA, 1992.
R. Fletcher, Practical Methods of Optimization, 2nd edn., Wiley, New York, 1987.
O. L. Frost III, An Algorithm for Linearly Constrained Adaptive Antenna Array Processing, Proc. IEEE, vol. 60, no. 8, August 1972, pp. 926–935.
P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization, Academic Press, San Diego, CA, 1988.
P. E. Gill, W. Murray, and M. H. Wright, Numerical Linear Algebra and Optimization, vol. 1, Addison-Wesley, Reading, MA, 1990.
L. J. Griffiths, A Simple Adaptive Algorithm for Real Time Processing in Antenna Arrays, Proc. IEEE, vol. 57, no. 10, October 1969.
L. J. Griffiths and K. M. Buckley, Quiescent Pattern Control in Linearly Constrained Adaptive Arrays, IEEE Trans. Acoust. Speech Signal Process., vol. 35, no. 7, July 1987, pp. 917–926.
R. Horst and Hoang Tuy, Global Optimization, 2nd edn., Springer-Verlag, Berlin, 1993.
R. T. Lacoss, Adaptive Combining of Wideband Array Data for Optimal Reception, IEEE Trans. Geosci. Electron., vol. 6, May 1968, pp. 78–86.
D. G. Luenberger, Linear and Non-linear Programming, 2nd edn., Addison-Wesley, Reading, MA, 1984.
J. A. Neider and R. Mead, A Simplex Method for Function Minimization, Comput. J., vol. 7, 1965.
P. M. Pardalos and J. B. Rosen, Constrained Global Optimization: Algorithms and Applications, (G. Roos and J. Hartmanis, editors), Lecture Notes in Computer Science, vol. 268, Springer-Verlag, Berlin, 1987.
J. Renegar, On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae, SIAM J. Comput., vol. 21, no. 6, Dec. 1992, pp. 1008–1025.
J. Renegar, On the Computational Complexity and Geometry of the First Order Theory of the Reals. Part I: Introduction: Preliminaries; the Geometry of Semi-Algebraic Sets; the Decision Problem for the Existential Theory of the Reals, J. Symbolic Comput., vol. 13, 1992, pp. 255–299.
J. Renegar, On the Computational Complexity and Geometry of the First Order Theory of the Reals. Part II: the General Decision Problem; Preliminaries for Quantifier Elimination, J. Symbolic Comput., vol. 13, 1992, pp. 301–327.
B. T. Smith, ZERPOL: A Zero Finding Algorithm for Polynomials Using Laguerre's Method, Technical Report, Department of Computer Science, University of Toronto, 1967.
K. Takao, M. Fujita, and T. Nishi, An Adaptive Antenna Array under Directional Constraint, IEEE Trans. Antennas and Propagation, vol. 24, 1976, pp. 662–669.
K. Takao and K. Komiyama, An Adaptive Antenna for Rejection of Wideband Interference, IEEE Trans. Aerospace Electron. Systems, vol. 16, no. 4, July 1980.
I. Thng, A. Cantoni, and Y. H. Leung, Derivative Constrained Optimum Broad Band Antenna Arrays, IEEE Trans. Signal Process., vol. 41, no. 7, July 1993, pp. 2376–2388.
A. Torn and A. Zilinskas, Global Optimization, (G. Roos and J. Hartmanis, editors), Lecture Notes in Computer Science, vol. 350, Springer-Verlag, Berlin, 1987.
C. Y. Tseng, Minimum Variance Beamforming with Phase-Independent Derivative Constraints, IEEE Trans. Antennas and Propagation, vol. 40, no. 3, Mar. 1992, pp. 285–294.
B. L. van der Waerden, Modern Algebra, vol. 2, Ungar, New York, 1950.
J. H. Wilkinson, Rounding Errors in Algebraic Processes, Prentice-Hall, Englewood Cliffs, NJ, 1963.
Author information
Authors and Affiliations
Additional information
This research was supported by the Australian Research Council and the Corporative Research Centre for Broadband Telecommunications and Networking.
Rights and permissions
About this article
Cite this article
Thng, I., Cantoni, A. & Leung, Y.H. Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints. Appl Math Optim 34, 161–182 (1996). https://doi.org/10.1007/BF01182622
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01182622