2019
January 25, 2019. Exact clustering by semidefinite programming under the heterogeneous planted cluster model. UA Applied Math Seminar, The University of Alabama, Tuscaloosa, Alabama.
2017
July 7, 2017. Semidefinite relaxations of the clustering program and first-order methods for their solution.
Workshop on Modern Convex Optimization and Applications: AN70. The Fields Institute for Research in Mathematical Sciences, Toronto, Ontario.
slides | video
Workshop on Modern Convex Optimization and Applications: AN70. The Fields Institute for Research in Mathematical Sciences, Toronto, Ontario.
slides | video
May 24, 2017. Proximal methods for sparse discriminant analysis.
2017 SIAM Conference on Optimization. Session CP16 Sparse Optimization, Vancouver, British Columbia.
2017 SIAM Conference on Optimization. Session CP16 Sparse Optimization, Vancouver, British Columbia.
April 14, 2017. How to reliably find a hidden clique.
University of Alabama Applied Math Seminar, The University of Alabama, Tuscaloosa, Alabama.
University of Alabama Applied Math Seminar, The University of Alabama, Tuscaloosa, Alabama.
January 27, 2017. A sparse regression approach for evaluating and predicting NHL results.
Alabama Program in Sports Communication, Fifth Annual Sports Symposium. The University of Alabama, Tuscaloosa, Alabama.
Alabama Program in Sports Communication, Fifth Annual Sports Symposium. The University of Alabama, Tuscaloosa, Alabama.
2016
March 13, 2016. Fast classification of Big Data: proximal methods for sparse discriminant analysis.
SIAM Southeastern Atlantic Conference. Session on Optimization, optimal control, and numerical simulations with applications, University of Georgia, Athens, Georgia
SIAM Southeastern Atlantic Conference. Session on Optimization, optimal control, and numerical simulations with applications, University of Georgia, Athens, Georgia
March 12, 2015. Ptychographic phase retrieval by convex relaxation
SIAM Southeastern Atlantic Conference. Session on Inverse Problems and Imaging, University of Georgia, Athens, Georgia
SIAM Southeastern Atlantic Conference. Session on Inverse Problems and Imaging, University of Georgia, Athens, Georgia
2015
November 7, 2015. Alternating direction methods for dimension reduction, classification, and feature selection
2015 UA Applied Math Joint Program Meeting, University of Alabama at Huntsville, Huntsville, Alabama.
November 1, 2015. Proximal Methods for Sparse Discriminant Analysis
2015 INFORMS Annual Meeting. Session on Theory and Applications of Coordinate Descent and Alternating Direction Methods, Philadelphia, Pennsylvania
August 13, 2015. Alternating Direction Methods for Dimension Reduction, Classification, and Feature Selection
DTU Compute Seminar, Technical University of Denmark, Lyngby, Denmark.
January 20, 2015. Sparsity, Structure, Regularization, and Relaxation
UA Pi Mu Epsilon Meeting, The University of Alabama, Tuscaloosa, Alabama.
2015 UA Applied Math Joint Program Meeting, University of Alabama at Huntsville, Huntsville, Alabama.
November 1, 2015. Proximal Methods for Sparse Discriminant Analysis
2015 INFORMS Annual Meeting. Session on Theory and Applications of Coordinate Descent and Alternating Direction Methods, Philadelphia, Pennsylvania
August 13, 2015. Alternating Direction Methods for Dimension Reduction, Classification, and Feature Selection
DTU Compute Seminar, Technical University of Denmark, Lyngby, Denmark.
January 20, 2015. Sparsity, Structure, Regularization, and Relaxation
UA Pi Mu Epsilon Meeting, The University of Alabama, Tuscaloosa, Alabama.
2014
November 10, 2014. Alternating Direction Methods for Penalized Classification
2014 INFORMS Annual Meeting, Session on Optimization Modeling and Methodologies in Big Data, Hilton San Francisco Union Square & Parc 55 Wyndham, San Francisco, California.
November 9, 2014. Robust convex relaxation for the sparse planted clique problem
2014 INFORMS Annual Meeting, Session on Applications of Conic Optimization, Hilton San Francisco Union Square & Parc 55 Wyndham, San Francisco, California.
October 10, 2014. Alternating Direction Methods for Dimensionality Reduction, Classification, and Feature Selection
University of Alabama Applied Math Seminar, The University of Alabama, Tuscaloosa, Alabama.
May 20, 2014. Alternating Direction Methods for Penalized Classification.
2014 SIAM Conference on Optimization, MS52 Optimization for Clustering and Classification, Town and Country Resort and Convention Center, San Diego, California. abstract
(Part of a minisymposium I organized on optimization approaches for clustering and classification. A full list of speakers and titles can be found here).
March 20, 2014. Finding hidden cliques and clusters by convex optimization.
CUNY College of Staten Island, Staten Island, New York.
February 28, 2014. Finding hidden cliques and clusters by convex optimization.
Georgia Southern University, Statesboro, Georgia.
February 20, 2014. Finding hidden cliques and clusters by convex optimization.
University of Alabama, Tuscaloosa, Alabama.
February 4, 2014. Finding hidden cliques and clusters by convex optimization.
Math and Stat Colloquium, Oakland University, Rochester, Michigan. abstract
January 30, 2014. Finding Hidden Cliques and Clusters Using Convex Optimization.
Computational and Applied Mathematics Colloquium, Rice University, Houston, Texas. abstract
2014 INFORMS Annual Meeting, Session on Optimization Modeling and Methodologies in Big Data, Hilton San Francisco Union Square & Parc 55 Wyndham, San Francisco, California.
November 9, 2014. Robust convex relaxation for the sparse planted clique problem
2014 INFORMS Annual Meeting, Session on Applications of Conic Optimization, Hilton San Francisco Union Square & Parc 55 Wyndham, San Francisco, California.
October 10, 2014. Alternating Direction Methods for Dimensionality Reduction, Classification, and Feature Selection
University of Alabama Applied Math Seminar, The University of Alabama, Tuscaloosa, Alabama.
May 20, 2014. Alternating Direction Methods for Penalized Classification.
2014 SIAM Conference on Optimization, MS52 Optimization for Clustering and Classification, Town and Country Resort and Convention Center, San Diego, California. abstract
(Part of a minisymposium I organized on optimization approaches for clustering and classification. A full list of speakers and titles can be found here).
March 20, 2014. Finding hidden cliques and clusters by convex optimization.
CUNY College of Staten Island, Staten Island, New York.
February 28, 2014. Finding hidden cliques and clusters by convex optimization.
Georgia Southern University, Statesboro, Georgia.
February 20, 2014. Finding hidden cliques and clusters by convex optimization.
University of Alabama, Tuscaloosa, Alabama.
February 4, 2014. Finding hidden cliques and clusters by convex optimization.
Math and Stat Colloquium, Oakland University, Rochester, Michigan. abstract
January 30, 2014. Finding Hidden Cliques and Clusters Using Convex Optimization.
Computational and Applied Mathematics Colloquium, Rice University, Houston, Texas. abstract
2013
August 16, 2013. Finding Hidden Cliques and Dense Subgraphs via Convex Optimization.
2013 Modeling and Optimization: Theory and Applications (MOPTA) Conference, technical session on Semidefinite Optimization, Lehigh University, Bethlehem, Pennsylvania.
April 11, 2013. How to find a hidden clique.
Clemson University Algebra and Discrete Math (ADM) Seminar, Clemson University, Clemson, South Carolina.
March 21, 2013. How to find a hidden clique.
University of Idaho, Moscow, Idaho.
March 15, 2013. How to find a hidden clique.
MSCS Research Seminar, St. Olaf College, Northfield, Minnesota.
February 8, 2013. Clique and Cluster Identification using Convex Optimization.
UMBC Applied Math Colloquium, University of Maryland, Baltimore County, Baltimore, Maryland.
February 5, 2013. Clique and Cluster Identification using Convex Optimization.
IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
2013 Modeling and Optimization: Theory and Applications (MOPTA) Conference, technical session on Semidefinite Optimization, Lehigh University, Bethlehem, Pennsylvania.
April 11, 2013. How to find a hidden clique.
Clemson University Algebra and Discrete Math (ADM) Seminar, Clemson University, Clemson, South Carolina.
March 21, 2013. How to find a hidden clique.
University of Idaho, Moscow, Idaho.
March 15, 2013. How to find a hidden clique.
MSCS Research Seminar, St. Olaf College, Northfield, Minnesota.
February 8, 2013. Clique and Cluster Identification using Convex Optimization.
UMBC Applied Math Colloquium, University of Maryland, Baltimore County, Baltimore, Maryland.
February 5, 2013. Clique and Cluster Identification using Convex Optimization.
IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
2012
November 28, 2012. Clique and cluster identication using convex optimization.
Kansas State University Mathematics Colloquium, Kansas State University, Manhattan, Kansas.
July 12, 2012. Guaranteed biclustering via semidefinite programming.
CP18: Optimization, 2012 SIAM Annual Meeting, Hyatt Regency, Minneapolis, Minnesota.
July 5, 2012. Finding overlapping communities.
IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
May 22, 2012. Robust convex relaxation for the clique and densest k-subgraph problems.
IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
February 25, 2012. Semidefinite relaxation for the clustering and biclustering problems.
2012 INFORMS Optimization Society Conference, University of Miami, School of Business Administration, Coral Gables, Florida.
Kansas State University Mathematics Colloquium, Kansas State University, Manhattan, Kansas.
July 12, 2012. Guaranteed biclustering via semidefinite programming.
CP18: Optimization, 2012 SIAM Annual Meeting, Hyatt Regency, Minneapolis, Minnesota.
July 5, 2012. Finding overlapping communities.
IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
May 22, 2012. Robust convex relaxation for the clique and densest k-subgraph problems.
IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
February 25, 2012. Semidefinite relaxation for the clustering and biclustering problems.
2012 INFORMS Optimization Society Conference, University of Miami, School of Business Administration, Coral Gables, Florida.
2011
December 13, 2011. Derivatives of Eigenvalue Functions.
IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
November 8, 2011. Exact semidefinite relaxation for the clustering and biclustering problems.
IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
July 19, 2011. Semidefinite Relaxation for the Clique Partitioning and Clustering Problems.
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.
May 19, 2011. Convex Relaxation for the Clique and Clustering Problems.
MS83 An Algebraic View of Sparse Optimization, 2011 SIAM Conference on Optimization, Darmstadtium Conference Center, Darmstadt, Germany.
May 2, 2011. Convex Relaxation for the Clique and Clustering Problems.
Optimization Days 2011, GERAD-HEC Montreal, Montreal, Quebec.
IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
November 8, 2011. Exact semidefinite relaxation for the clustering and biclustering problems.
IMA Postdoc Seminar, University of Minnesota, Minneapolis, Minnesota.
July 19, 2011. Semidefinite Relaxation for the Clique Partitioning and Clustering Problems.
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.
May 19, 2011. Convex Relaxation for the Clique and Clustering Problems.
MS83 An Algebraic View of Sparse Optimization, 2011 SIAM Conference on Optimization, Darmstadtium Conference Center, Darmstadt, Germany.
May 2, 2011. Convex Relaxation for the Clique and Clustering Problems.
Optimization Days 2011, GERAD-HEC Montreal, Montreal, Quebec.
2010
July 14, 2010. Convex Relaxation for the Planted Cluster Problem.
MS68 Minisymposium on Matrix Rank Minimization, 2010 SIAM Annual Meeting, The David Lawrence Convention Center, Pittsburgh, Pennsylvania.
March 2, 2010. Convex relaxation for the clique, bliclique and clustering problem.
Workshop on Randomization, Relaxation, and Complexity (10w5119), Banff International Research Station, Alberta.
MS68 Minisymposium on Matrix Rank Minimization, 2010 SIAM Annual Meeting, The David Lawrence Convention Center, Pittsburgh, Pennsylvania.
March 2, 2010. Convex relaxation for the clique, bliclique and clustering problem.
Workshop on Randomization, Relaxation, and Complexity (10w5119), Banff International Research Station, Alberta.
2009
August 26, 2009. Nuclear norm minimization for the planted clique and biclique problems.
2009 International Symposium on Mathematical Programming, Chicago, Illinois. (talk given by co-author Stephen Vavasis)
April 30, 2009. Nuclear norm minimization for the planted clique and biclique problems.
2009 University of Waterloo Graduate Student Research Conference, University of Waterloo, Waterloo, Ontario.
February 12, 2009. Nuclear norm minimization for the planted clique and biclique problems.
Continuous Optimization Seminar, University of Waterloo, Waterloo, Ontario.
2009 International Symposium on Mathematical Programming, Chicago, Illinois. (talk given by co-author Stephen Vavasis)
April 30, 2009. Nuclear norm minimization for the planted clique and biclique problems.
2009 University of Waterloo Graduate Student Research Conference, University of Waterloo, Waterloo, Ontario.
February 12, 2009. Nuclear norm minimization for the planted clique and biclique problems.
Continuous Optimization Seminar, University of Waterloo, Waterloo, Ontario.