A convex relaxation to compute the nearest structured rank deficient matrix
Diego Cifuentes (2019). "A convex relaxation to compute the nearest structured rank deficient matrix." arXiv:1904.09661.
CV
Education
- Ph.D in Electrical Engineering and Computer Science, MIT, 2018
- M.S. in Electrical Engineering and Computer Science, MIT, 2014
- B.S. in Electronics Engineering, Universidad de los Andes, 2012 (Summa Cum Laude)
- B.S. in Mathematics, Universidad de los Andes, 2012 (Summa Cum Laude)
Publications
-
Burer-Monteiro guarantees for general semidefinite programs
Diego Cifuentes (2019). "Burer-Monteiro guarantees for general semidefinite programs." arXiv:1904.07147.
-
On the Complexity of Toric Ideals
Diego Cifuentes, Shmuel Onn (2019). "On the Complexity of Toric Ideals." arXiv:1902.01484.
-
Sums of squares in Macaulay2
Diego Cifuentes, Thomas Kahle, Pablo Parrilo (2018). "Sums of squares in Macaulay2." arXiv:1812.05475.
-
Voronoi Cells of Varieties
Diego Cifuentes, Kristian Ranestad, Bernd Sturmfels, Madeleine Weinstein (2018). "Voronoi Cells of Varieties." arXiv:1811.08395.
-
The geometry of SDP exactness in quadratic optimization
Diego Cifuentes, Corey Harris, Bernd Sturmfels (2018). "The geometry of SDP exactness in quadratic optimization." arXiv:1804.01796.
-
On the local stability of semidefinite relaxations
Diego Cifuentes, Sameer Agarwal, Pablo Parrilo, Rekha Thomas (2017). "On the local stability of semidefinite relaxations." arXiv:1710.04287.
-
Sampling algebraic varieties for sum of squares programs
Diego Cifuentes, Pablo Parrilo (2017). "Sampling algebraic varieties for sum of squares programs." SIAM J. Optimization. 27(4):2381-2404.
-
Chordal networks of polynomial ideals
Diego Cifuentes, Pablo Parrilo (2016). "Chordal networks of polynomial ideals." SIAM J. Appl. Algebra Geometry. 1(1):73-170.
-
Exploiting chordal structure in polynomials ideals: A Gröbner bases approach
Diego Cifuentes, Pablo Parrilo (2016). "Exploiting chordal structure in polynomials ideals: A Gröbner bases approach." SIAM J. Discrete Math.. 30(3):1534-1570.
-
An efficient tree decomposition method for permanents and mixed discriminants
Diego Cifuentes, Pablo Parrilo (2016). "An efficient tree decomposition method for permanents and mixed discriminants." Linear Algebra and its Applications. 493:45-81.
-
Bringing cross-layer MIMO to today’s wireless LANs
Swarun Kumar, Diego Cifuentes, Shyamnath Gollakota, and Dina Katabi (2013). "Bringing cross-layer MIMO to today’s wireless LANs." Proceedings of the ACM SIGCOMM, Hong Kong, China.
-
On the degree-chromatic polynomial of a tree
Diego Cifuentes (2012). "On the degree-chromatic polynomial of a tree." DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC), Nagoya, Japan.
Honors
- Jacobs Presidential Fellowship, MIT EECS (2012)
- Ramon de Zubiria Scholarship, Universidad de los Andes (2010, 11, 12)
- Biannual Excellence Scholarship, Universidad de los Andes (2009, 09, 10)
- Top 5 at Vojtech Jarnik International Mathematical Competition (2011)
- First Prize at International Mathematics Competition for University Students (2010)
- Gold Medal at Iberoamerican University Mathematical Competition (2009)
- National Top Score over 500.000 students in the colombian ICFES standarized test (2007)
- Bronze Medal at International Math Olympiad (2006)
Talks
-
Graphical structure in polynomial ideals”
Talk at Discrete Math Days of the NorthEast, UMass Amherst, Amherst, MA
-
On the stability of semidefinite relaxations
Talk at Real Algebraic Geometry and Optimization, ICERM, Providence, RI
-
“Chordal” package: Exploiting graphical structure in polynomial ideals
Talk at Core Computational Methods in Nonlinear Algebra, ICERM, Providence, RI
-
Introduction to Sum-of-Squares and Polynomial Optimization”
Talk at Nonlinear Algebra Bootcamp, ICERM, Providence, RI
-
On the local stability of semidefinite relaxations
Talk at ISMP, Bordeaux, Bordeaux, France
-
On the local stability of semidefinite relaxations
Talk at Oberseminar Optimierung, Leipzig University, Leipzig, Germany
-
Graphical structure in polynomial systems: Chordal networks
Talk at Latinx in the Mathematical Sciences, UCLA IPAM, Los Angeles, CA
-
The nearest point to a variety
Talk at Optimization Day, MPI MiS, Leipzig, Germany
-
On the local stability of semidefinite relaxations
Talk at Simons Institute for the Theory of Computing, Berkeley, CA, USA
-
Graphical structure in polynomial systems: Chordal networks
Talk at Optimization Seminar, Princeton ORFE, Princeton, NJ
-
Graphical structure in polynomial systems: Chordal networks
Talk at MIC Seminar, Courant Institute, New York City, NY
-
On the local stability of semidefinite relaxations
Talk at Workshop for Young Researchers, Cornell ORI, Ithaca, NY
-
Sampling varieties for SOS optimization
Talk at Coloquio de Matematicas, Universidad de los Andes, Bogota, Colombia
-
Graphical structure in polynomial systems: Chordal networks
Talk at Coloquio Latinoamericano de Algebra, Quito, Ecuador
-
The nearest point to a variety problem, near the variety
Talk at SIAM Conference on Applied Algebraic Geometry, Atlanta, GA
-
Chordal package: Exploiting graphical structure in polynomial ideals
Talk at Macaulay2 tutorial, Georgia Tech, Atlanta, GA
-
Graphical structure in polynomial systems: Chordal networks
Talk at SIAM Conference on Optimization, Vancouver, Canada
-
Chordal networks of polynomial ideals
Talk at Algebraic Statistics Workshop, Oberwolfach, Germany
-
Graphical structure in polynomial systems: Chordal networks
Talk at Algebra Seminar, Georgia Tech, Atlanta, GA
-
Sampling varieties for SOS optimization
Talk at LIDS Student Conference, MIT, Cambridge, MA
-
Sampling varieties for SOS optimization
Talk at Joint Mathematics Meeting, Atlanta, GA
-
Graphical structure in polynomial systems: Chordal networks
Talk at Joint Mathematics Meeting, Atlanta, GA
-
Sampling varieties for SOS optimization
Talk at AMS Sectional Meeting, North Carolina State University, Raleigh, NC
-
Graphical structure in polynomial systems: Chordal networks
Talk at SIAM Annual Meeting, Boston, MA
-
Chordal structure in computer algebra: Permanents
Talk at SIAM Conference on Discrete Mathematics, Atlanta, GA
-
Chordal structure in polynomial systems
Talk at AMS Sectional Meeting, University of Georgia, Athens, GA
-
Chordal structure in polynomial systems
Talk at LIDS Student Conference, MIT, Cambridge, MA
-
Chordal structure in polynomial systems
Talk at CACAO Seminar, UC Davis, Department of Mathematics, Davis, CA, USA
Teaching
Service and leadership
- Organized mini-symposium “Structured polynomial equations and applications” at SIAM Annual Meeting’ 17
- Coordinator of the national math olympiads for high school and undergraduate students (Jan–Jun’ 12)