*************************************************************************

                Department of Mathematical Sciences
                   The Johns Hopkins University

                             SEMINAR

*************************************************************************

Zhi-Quan (Tom) Luo                                     February 07, 2002
Department of Electrical and Computer Engineering      304 Whitehall Hall 
McMaster University                                    Refreshments: 3:30 PM 
                                                       Seminar: 4:00 PM 

*************************************************************************

    CONVEX OPTIMIZATION IN DIGITAL COMMUNICATION AND SIGNAL PROCESSING


*************************************************************************

                               ABSTRACT

In this talk, we will briefly review the theory of convex optimization 
and semidefinite programming, and then show how they can be used to 
solve some important digital communication problems efficiently. 
Examples will be given to show that certain nonconvex and semi-infinite 
spectral mask constraints can be reformulated as linear matrix inequalities. 
This facilitates the formulation of a diverse class of filter and 
beamformer design problems as semidefinite programmes.  Our results 
extend the well-known Positive-Real and Bounded-Real Lemmas from the 
systems and control literature.