How to find a hidden clique.
March 15, 2013, MSCS Research Seminar, St. Olaf College, Northfield, Minnesota.
(slides)
Clique and Cluster Identification using Convex Optimization.
February 8, 2013, Applied Math Colloquium, University of Maryland, Baltimore County,
Baltimore, Maryland.
(slides)
Clique and Cluster Identification using Convex Optimization.
February 5, 2013, IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
(slides)
Clique and cluster identication using convex optimization.
November 28, 2012, Kansas State University Mathematics
Colloquium, Kansas State University, Manhattan, Kansas.
(slides)
Guaranteed biclustering via semidefinite programming.
July 12, 2012, CP18: Optimization, 2012 SIAM Annual Meeting, Hyatt Regency, Minneapolis, Minnesota.
(slides)
Finding overlapping communities.
July 5, 2012, IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
(slides)
Robust convex relaxation for the clique and densest k-subgraph problems.
May 22, 2012, IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
(slides)
Semidefinite relaxation for the clustering and biclustering problems.
February 25, 2012, 2012 INFORMS Optimization Society Conference,
University of Miami School of Business Administration, Coral Gables, Florida.
(slides)
Derivatives of Eigenvalue Functions.
December 13, 2011, IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
(slides)
Exact semidefinite relaxation for the clustering and biclustering problems.
November 8, 2011, IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
(slides)
Semidefinite Relaxation for the Clique Partitioning and Clustering Problems.
July 19, 2011, MS144 Semidefinite Approaches to Combinatorial Problems - Part I of III, 7th International Congress on Industrial and Applied Mathematics - ICIAM 2011,
Vancouver Conference Center, Vancouver, British Columbia.
(slides)
Convex Relaxation for the Clique and Clustering Problems.
May 19, 2011, MS83 An Algebraic View of Sparse Optimization, 2011 SIAM Conference on Optimization,
Darmstadtium Conference Center, Darmstadt, Germany.
(slides)
Also presented May 2 at Optimization Days 2011, GERAD-HEC Montreal, May 2-4, 2011.
(slides)
Convex Relaxation for the Planted Cluster Problem.
July 14, 2010, MS68 Minisymposium on Matrix Rank Minimization, 2010 SIAM Annual Meeting,
The David Lawrence Convention Center, Pittsburgh, Pennsylvania.
(slides)
Convex relaxation for the clique, bliclique and clustering problem.
March 2, 2010 at the Workshop on Randomization, Relaxation, and Complexity (10w5119),
Banff International Research Station, Alberta.
(slides)
Nuclear norm minimization for the planted clique and biclique problems.
February 12, 2009, Continuous Optimization Seminar, University of Waterloo, Waterloo, Ontario.
(slides)
I presented a short version of this talk at the 2009 University of Waterloo Graduate Student Research Conference,
University of Waterloo, Waterloo, Ontario on April 30, 2009
and Steve Vavasis gave a talk on this material
August 26, 2009 at the 2009 International Symposium on Mathematical Programming, Chicago, Illinois.
(GSRC) (ISMP)