Talks | Mehdi Karimi

Invited Talks & Conference Presentations

October 2024: INFORMS Annual Meeting, Seattle, Washington — Polynomial-time Interior-Point Methods for Convex Optimization Beyond Symmetric Cones.
July 2024: International Symposium for Mathematical Programming (ISMP), Montreal, Quebec — Efficient Quantum Relative Entropy Programming with SDP Preprocessing.
June 2024: European Conference on Operations Research, Copenhagen, Denmark — Efficient Quantum Relative Entropy Programming with SDP Preprocessing.
May 2023: SIAM Conference on Optimization, Seattle — Efficient Implementation of Interior-Point Methods for Quantum Relative Entropy.
Jan 2022: 17th INFORMS Computing Society Conference, Tampa — Domain-Driven Solver (DDS) Version 2.1.
Nov 2020: INFORMS Annual Meeting, Virtual — Domain-Driven Solver (DDS): a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form.
August 2019: ICCOPT, Berlin, Germany — Convex Optimization Problems in Domain-Driven Form: Theory, Algorithms, and Software.
Jan 2019: Tutte Colloquium, Department of C&O, University of Waterloo — Convex Optimization Problems in Domain-Driven Form: Theory, Algorithms, and Software.
Nov 2017: Pure Math/C&O Joint Colloquium, University of Waterloo — Sum-of-Squares Proofs in Optimization.
July 2017: Fields Institute, Workshop on Modern Convex Optimization and Applications, Toronto, Canada — Convex Optimization via Domain-Driven Barriers and Primal-Dual Interior-Point Methods.
Dec 2016: Canadian Mathematical Society Winter Meeting, Niagara Falls, Canada — Convex Optimization via Domain-Driven Barriers and Primal-Dual Algorithms.
Nov 2016: INFORMS Annual Meeting, Nashville, USA — Primal-Dual Interior-Point Methods with Domain-Driven Barriers.
June 2016: Fields Institute, Workshop on Nonlinear Optimization Algorithms and Industrial Applications, Toronto, Canada — Primal-Dual Interior-Point Methods with Domain-Driven Barriers.
July 2015: 22nd International Symposium on Mathematical Programming, Pittsburgh, USA — “Cone-Free” Infeasible-Start Primal-Dual Methods.
July 2015: MOPTA, Lehigh University, USA — “Cone-Free” Infeasible-Start Primal-Dual Methods.
Oct 2013: 15th Midwest Optimization Meeting, University of Western Ontario — A Quick-and-Dirty Approach to Robustness in Linear Optimization.