Global and local optimization algorithms for optimal signal set design

15Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

The problem of choosing an optimal signal set for non-Gaussian detection was reduced to a smooth inequality constrained mini-max nonlinear programming problem by Gockenbach and Kearsley. Here we consider the application of several optimization algorithms, both global and local, to this problem. The most promising results are obtained when special-purpose sequential quadratic programming (SQP) algorithms are embedded into stochastic global algorithms.

Cite

CITATION STYLE

APA

Kearsley, A. J. (2001). Global and local optimization algorithms for optimal signal set design. Journal of Research of the National Institute of Standards and Technology, 106(2), 441–454. https://doi.org/10.6028/jres.106.019

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free