- Sharp exact penalty formulations in signal recovery
- ICIAM 2023 (Int. Congr. on Ind. and Appl. Math.)
Tokyo, Japan, Aug. 2023
- First-order methods for nonconvex quadratically constrained quadratic programs
- OP23 (SIAM Conf. on Optim.)
Seattle, WA, May 2023
- Workshop on Semidefinite and Polynomial Optimization
Amsterdam, Netherlands, August 2022
- ICCOPT 2022 (Int. Conf. on Continuous Optim.)
Bethlehem, PA, July 2022
[slides]
- Networks and Optimization Seminar @ CWI
Online, Feb. 2022
- Accurately and efficiently solving structured nonconvex optimization problems
- University of Illinois Urbana-Champaign
Online, Mar. 2022
[slides]
- Purdue University Krannert School of Business
West Lafayette, IN, Jan. 2022
[slides]
- Mathematics of Data & Decisions Seminar @ UC Davis
Online, Jan. 2022
[slides]
- Argonne National Labroratory
Online, Jan. 2022
[slides]
- CAAM Colloquium @ Rice University
Houston, TX, Dec. 2021
[slides]
- Exactness in SDP relaxations of QCQPs: Theory and applications
- INFORMS 2021 (INFORMS Annual Meeting)
Anaheim, CA, Oct. 2021
Invited tutorial talk
- New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
- INFORMS 2021 (INFORMS Annual Meeting)
Anaheim, CA, Oct. 2021
- MOPTA 2021 (Model. and Optim.: Theory and Appl.)
Online, Aug. 2021
[slides]
[code]
- CMU Theory Lunch
Online, Apr. 2021
[slides]
[recording]
[code]
- Sufficient conditions for exact SDP reformulations of QCQPs
- INFORMS 2021 (INFORMS Annual Meeting)
Anaheim, CA, Oct. 2021
INFORMS Optimization Society’s 2021 Student Paper Prize
- IPCO 2020 (Conf. on Integer Programming and Comb. Optim.)
Online, June 2020
[slides]
[recording]
OP20 (SIAM Conf. on Optim.), IOS 2020 (INFORMS Optim. Soc. Conf.)
canceled due to COVID-19- INFORMS 2019 (INFORMS Annual Meeting)
Seattle, WA, Oct. 2019
[slides]
- A geometric treatment of SDP exactness in QCQPs and its applications
- INFORMS 2020 (INFORMS Annual Meeting)
Online, Nov. 2020
[slides]
- Exactness in semidefinite programming
- CMU Process Systems Engineering Seminar Series
Online, Oct. 2020
[slides]
- CMU Theory Lunch
Online, Sept. 2020
[slides]
[recording]
- A linear-time algorithm for GTRS based on a convex quadratic reformulation
- Hardy-Muckenhoupt bounds for Laplacian eigenvalues
- APPROX 2019 (Int. Workshop on Approx. Algorithms for Comb. Optim. Prob.)
Boston, MA, Sept. 2019
[slides]
- CMU Theory Lunch
Pittsburgh, PA, May 2019
[slides]
[recording]
Last updated Jan 03, 2023