Algorithms for optimal signal set design

References

• Poor , H. V. 1994 . An Introduction to Signal Detection and Estimation , New York : Springer Verlag .
   Google Scholar
• Proakis , J. G. 1989 . Digital Communications , New York : McGraw Hill .
   Google Scholar
• Foschini , G. J. , Gitlin , R. D. and Weinstein , S. B. 1974 . Optimization of two-dimensional signal constellations in the presence of Gaussian noise . IEEE Transactions on Communications , 22(1) : 28 – 38 .
   Google Scholar
• Johnson , D. H. and Orsak , G. C. 1993 . Relation of signal set choice to the performance of optimal non-Gaussian detectors . IEEE Transactions on Communications , 41 ( 9 ) : 1319 – 1328 .
   Web of Science ®Google Scholar
• Gockenbach , M. S. and Kearsley , A. J. 1999 . Optimal signal sets for non-Gaussian detectors . SIAM Journal on Optimization , 9 ( 2 ) : 316 – 326 .
   Web of Science ®Google Scholar
• Kiwiel , K. C. 1983 . A phase I–phase II method for inequality constrained minimax problems . Control and Cybernetics , 12 : 55 – 75 .
   Google Scholar
• Panier , E. R. and Tits , A. L. A superlinearly convergent method of feasible directions for optimization problems arising in the design of engineering systems . Proceedings of the Seventh International Conference on Analysis and Optimization of Systems . June 25–27 , Antibes. Edited by: Bensoussan , A. and Lions , J. L. pp. 65 – 73 . Berlin : Springer Verlag . Lecture Notes in Control and Information Sciences 83
   Google Scholar
• Zhou , J. 1992 . “ Fast, globally convergent optimization algorithms, with applications to engineering system design ” . Department of Electrical Engineering, University of Maryland . PhD thesis, ISR-TR Ph.D. 92-2
   Google Scholar
• Zhou , J. L. and Tits , A. L. 1993 . Nonmonotone line search for minimax problems . Journal of Optimization Theory and Applications , 76 : 455 – 476 .
   Web of Science ®Google Scholar
• Panier , E. R. and Tits , A. L. 1987 . A superlinearly convergent feasible method for the solution of inequality constrained optimization problems . SIAM Journal on Control and Optimization , 25 ( 4 ) : 934 – 950 .
   Web of Science ®Google Scholar
• Rustem , B. and Nguyen , Q. 1998 . An algorithm for the inequality-constrained discrete min-max problem . SIAM Journal on Optimization , 8 ( 1 ) : 265 – 283 .
   Web of Science ®Google Scholar
• Gill , P. E. , Murray , W. and Saunders , M. A. 2002 . SNOPT: an SQP algorithm for large-scale constrained optimization . SIAM Journal on Optimization , 12 ( 4 ) : 979 – 1006 .
   Web of Science ®Google Scholar
• Kearsley , A. J. 1996 . “ The use of optimization techniques in the solution of partial differential equations from science and engineering ” . Department of Computational and Applied Mathematics, Rice University . Technical Report and PhD thesis
   Google Scholar
• Spellucci , P. 1998 . A new technique for inconsistent QP problems in the SQP method . Mathematical methods of Operations Research , 47 : 355 – 400 .
   Web of Science ®Google Scholar
• Boggs , P. T. and Tolle , J. W. 1995 . Sequential quadratic programming . Acta Numerica , : 1 – 51 .
   Google Scholar
• Boggs , P. T. , Kearsley , A. J. and Tolle , J. W. 1999 . A practical algorithm for general large scale nonlinear optimization problems . SIAM Journal on Optimization , 9 ( 3 ) : 755 – 778 .
   Web of Science ®Google Scholar
• Herskovits , J. N. and Carvalho , L. A.V. A successive quadratic programming based feasible directions algorithm . Proceedings of the Seventh International Conference on Analysis and Optimization of Systems . June 25–27 , Antibes. Edited by: Bensoussan , A. and Lions , J. L. pp. 93 – 101 . Berlin : Springer Verlag . Lecture Notes in Control and Information Sciences 83
   Google Scholar
• Panier , E. R. and Tits , A. L. 1993 . On combining feasibility, descent and superlinear convergence in inequality constrained optimization . Mathematical Programming , 59 : 261 – 276 .
   Web of Science ®Google Scholar
• Polak , E. 1971 . Computational Methods in Optimization , New York : Academic Press .
   Google Scholar
• Lawrence , C. T. , Zhou , J. L. and Tits , A. L. 1996 . User’s guide for CFSQP version 2.4: A C code for solving (large scale) constrained nonlinear (minimax) optimization problems, generating iterates satisfying all inequality constraints , College Park, MD : University of Maryland . ISR TR-94-16r1, Institute for Systems Research
   Google Scholar
• Boender , C. G.E. and Romeijn , H. E. 1995 . “ Stochastic methods ” . In Handbook of Global Optimization , Edited by: Horst , R. and Pardalos , P. 829 – 869 . The Netherlands : Kluwer Academic Publishers .
   Google Scholar
• Rinooy Kan , A. H.G. and Timmer , G. T. 1987 . Stochastic global optimization methods. Part II: multi-level methods . Mathematical Programming , 39 : 57 – 78 .
   Web of Science ®Google Scholar
• Gockenbach , M. S. , Kearsley , A. J. and Symes , W. W. 1997 . An infeasible point method for minimizing the Lennard-Jones potential . Computational Optimization and Applications , 8 : 273 – 286 .
   Web of Science ®Google Scholar
• Harwell Subroutine Library . 1985 . Library Reference Manual , England : Harwell .
   Google Scholar
• Powell , M. J.D. 1978 . “ A fast algorithm for nonlinearly constrained optimization calculations ” . In Numerical Analysis , Edited by: Watson , G. A. 144 – 157 . Springer Verlag . Dundee, 1977, Lecture Notes in Mathematics 630
   Google Scholar
• Boggs , P. T. , Kearsley , A. J. and Tolle , J. W. 1999 . A global convergence analysis of an algorithm for large-scale nonlinear optimization problems . SIAM Journal on Optimization , 9 ( 4 ) : 833 – 862 .
   Web of Science ®Google Scholar