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

                Department of Mathematical Sciences                       
                   The Johns Hopkins University                           
                                                                        
                              SEMINAR                                
                                                                        
*************************************************************************

Jong-Shi Pang                                     September 20, 2001
Department of Mathematical Sciences               304 Whitehead Hall
The Johns Hopkins University                      Refreshments: 3:30 p.m.
                                                  Seminar: 4:00 p.m.

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

          COPOSITIVE MATRICES IN MATHEMATICAL PROGRAMMING               
                                                                        
*************************************************************************

                               ABSTRACT

A real square matrix is copositive on a cone in an Euclidean space if the 
associated quadratic form is nonnegative everywhere on the cone.  The concept 
of copositivity is a generalization of that of positive semidefinteness, 
which corresponds to the case where the cone is the entire Euclidean space.  
In this talk, we give a survey of the many roles played by copositivity in 
the contexts of constrained optimization problems and variational inequalities.

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