Sum of squares (SOS) programs are a particular class of convex optimizationproblems, that combine in a very appealing way notions from algebraic and numeric computation (in particular, semidefinite programming). They are based on the sum of squares decomposition for multivariate polynomials, and have found many interesting applications, mainly t...
Creator:
Parrilo, Pablo A. (Massachusetts Institute of Technology)
Created:
2006-10-26
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
We discuss algorithms for optimizing polynomials onsemialgebraic sets using representation theorems from real algebraicgeometry for positive polynomials. In the case of compact semialgebraicsets, the method of Lasserre generates a sequence of SDP relaxationswhich converge to the solution, however this method does not alwayswork in the non-compac...
Creator:
Powers, Victoria (Emory University)
Created:
2007-01-18
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Given a large random matrix A, we consider the following testing problem. Under thenull hypothesis, every entry of A is generated i.i.d. from a distribution P_0. Under the alternative H_1, there is a submatrix indexed by Q, a subset of {1, 2, ... n} such thatthe entries of A in Q X Q are generated instead according to a different law P_1, while ...
Creator:
Deshpande, Yash (Stanford University)
Created:
2015-05-21
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Photo of Tom Nash at the summit of Mt. McKinley wearing a McCarthy campaign button. Thomas Nash's business card is stapled to the back of the photograph. Details of the expedition are written on the front of the photograph.
Created:
1968-06-11
Contributed By:
University of Minnesota Libraries, Special Collections and Rare Books.
