Personal Schedules Are Now Available
To create your personal schedule, sign in to your profile
Stream 1a: Nonlinear Programming I
FB75 — The interplay between optimization, statistics and machine learning II
-
AdaBB: A Parameter-Free Gradient Method for Convex Optimization
Shiqian Ma, Rice University -
Kernel Learning in Ridge Regression “Automatically” Yields Exact Low Rank Solution
Feng Ruan, Northwestern University -
Overparameterized Tensor Regression via Riemannian Optimization
Yuetian Luo, University of Chicago -
The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound
Vaidehi Srinivas, Northwestern University
FB154 — First-order Methods and Large-scale Optimization III
-
Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints
L Felipe Bueno, Federal University of São Paulo -
A Generalized Version of Chung’s Lemma and its Applications
Li Jiang, The Chinese University of Hong Kong, Shenzhen -
On the Trajectories of SGD Without Replacement
Pierfrancesco Beneventano, Princeton University -
Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods
Zijian Liu, New York University
FB114 — Computational advancement in nonconvex programming
-
EM Algorithms for Optimization Problems with Polynomial Objectives
Jun Ya Gotoh, Chuo University -
Level constrained first-order methods for nonconvex function constrained optimization
Digvijay Boob, Southern Methodist University -
** CANCELLED ** Methods of Difference-of-Convex Programming for Statistical Learning with Structured Sparsity
Miju Ahn, Southern Methodist University -
GPU Implementation of Algorithm NCL
Alexis Montoison, GERAD
FB70 — Nonlinear Programming for Data Science II
-
High order stochastic optimization without evaluating the function.
Serge Gratton, University of Toulouse, Inp, Irit, Aniti -
Randomized matrix decompositions for faster scientific computing
Robert Webber, California Institute of Technology -
Adaptive Stochastic Optimization with Constraints
Mladen Kolar, University of Chicago -
Random subspace second order methods for nonconvex optimization
Edward Tansley, University of Oxford
Stream 1b: Global Optimization
FB1 — Recent Advances in Global Optimization of Nonconvex Programs
-
Discretization Approaches for Non-Convex Mixed-Integer Nonlinear Programs
Robert Burlacu, University of Technology Nuremberg -
Constructing Tight Quadratic Underestimators for Global Optimization
Arvind Raghunathan, Mitsubishi Electric Research Laboratories -
A Generalizable End-to-End Learning Approach for Global Optimization of Quadratically-Constrained Quadratic Programs
Erin George, Ucla Mathematics -
Piecewise Polyhedral Relaxations of Multilinear Optimization
Mohit Tawarmalani, Purdue University
Stream 1c: Nonsmooth Optimization
FB257 — Complexity of Stationarity Concepts in Non-Smooth Optimization
-
Testing Approximate Stationarity Concepts for Piecewise Affine Functions
Lai Tian, The Chinese University of Hong Kong -
Strong Second-order Sufficient Condition of Decomposable Functions
Wenqing Ouyang, The Chinese University of Hongkong (Shenzhen) -
Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis
Linglingzhi Zhu, The Chinese University of Hong Kong
Stream 1d: Semi-Definite Programming
FB275 — Recent Advancements in the Theory and Applications of Semidefinite Programming
-
** MOVED TO 15h30 ** Navigating hidden convexity in nonconvex projection problems
Manish Krishan Lal, UBC -
** MOVED TO 14h00 ** The Maximum Singularity Degree for Linear and Semidefinite Programming
Hao Hu, Clemson University -
** MOVED TO 14h30 ** Ramana's dual redux
Gabor Pataki, UNC Chapel Hill -
** MOVED TO 15h00 ** A Peaceman-Rachford Splitting Method for the Protein Side-Chain Positioning Problem and other Hard Problems
Henry Wolkowicz, University of Waterloo
FB36 — SDP and Exact Relaxations of Hard Problems
-
Forward-Backward Extended DMD with an Asymptotic Stability Constraint
Louis Lortie, Mcgill University -
Convex conic reformulation of geometric nonconvex conic optimization problems and exact solutions of QCQPs by SDP relaxations
Sunyoung Kim, Ewha W. Univ. -
On the tightness of SDP relaxation for quadratic assignment problem
Shuyang Ling, NYU Shanghai -
High-rank Solution of Sum-of-Squares Relaxations for Exact Matrix Completion
Godai Azuma, Aoyama Gakuin University
Stream 1e: Variational Analysis, Variational Inequalities and Complementarity
FB336 — Nonsmooth and hierarchical optimization in machine learning
-
First-order methods for bilevel optimization
Zhaosong Lu, University of Minnesota -
Classification under strategic adversary manipulation using pessimistic bilevel optimisation
David Benfield, University of Southampton -
A Banach-space view of neural network training
Rahul Parhi, UCSD
Stream 1f: Random Methods for Continuous Optimization
FB52 — Splitting and Randomized Methods 4
-
A Recursive Multilevel Algorithm for Deep Learning
Isabel Jacob, Technical University Darmstadt -
Improved variance reduction extragradient method with line search for stochastic variational inequalities
Ting Li, Beihang University -
Differentially Private Federated Learning via Inexact ADMM with Multiple Local Updates
Jingya Chang, Guangdong University of Technology
Stream 1g: Derivative-free and Simulation-based Optimization
FB327 — Stochastic DFO 2
-
Stochastic derivative-free optimization algorithms using random subspace strategies
Kwassi Joseph Dzahini, Argonne National Laboratory -
Non-convergence analysis of probabilistic direct search
Zaikun Zhang, The Hong Kong Polytechnic University -
Full-low evaluation methods for bound and linearly constrained derivative-free optimization
Clément Royer, Université Paris Dauphine Psl -
Expected decrease for derivative-free algorithms using random subspaces
Clement Royer, Paris Dauphine
Stream 2a: Mixed Integer Linear Programming
FB151 — Recent Developments in MIP Theory and Applications
-
** MOVED TO 15:00 ** Proximity results in conic mixed-integer programming
Burak Kocuk, Sabanci University -
On formulations of the close-enough TSP
Gustavo Angulo, Pontificia Universidad Católica De Chile -
** MOVED TO 14:00 ** A Convexification-Based Outer-Approximation Method for Convex and Nonconvex MINLP
David Bernal Neira, Purdue University -
M-Decomposable Sets in Integer Programming
Diego Alejandro Moran Ramirez, Rensselaer Polytechnic Institute
FB919 — Mixed Integer Linear Programming 5
-
Generalized Cuts and Grothendieck Covers: Algorithmic Performance
Nathan Benedetto Proença, University of Waterloo -
** CANCELLED ** The Colorful Components Problems
Martina Cerulli, University of Salerno
Stream 2b: Mixed Integer Nonlinear Programming
FB9 — Theory of Mixed Integer Non-linear Programming
-
** CANCELLED ** Complexity of Mixed Integer Nonlinear Programming with Nonconvexities
Robert Hildebrand, Virginia Polytechnic Institute And State University -
A Knowledge Compilation Take on Binary Polynomial Optimization
Silvia Di Gregorio, Université Sorbonne Paris Nord -
On the power of linear programming for data clustering
Aida Khajavirad, Lehigh University -
Sample Complexity and Computational Results for Branch and Cut Using Neural Networks
Barbara Anna Fiedorowicz, Johns Hopkins University
Stream 2c: Combinatorial Optimization and Graph Theory
FB926 — Combinatorial Optimization and Graph Theory 6
-
Bounding the Proper Orientation Number by Tree-depth
Hirotaka Ono, Nagoya University -
Beam Search to Minimise Cutting Patterns with Maximum Utilisation
Claudia O López Soto, National Autonomous University of Mexico (Unam) -
3D Phase Unwrapping using 3D Surface minimization.
El Mehdi Oudaoud, Polytechnique Montreal -
Uncrossable Multicommodity Flows
Joseph Poremba, The University of British Columbia
Stream 2d: Machine Learning and Discrete Optimization
FB929 — Machine Learning and Discrete Optimization 3
-
FASTopt: An Optimization Framework for Fast Additive Segmentation in Transparent ML
Brian Liu, MIT -
Reliability evaluation of gaussian processes applied to power systems
Pierre Houdouin, RTE France -
Closed-loop Koopman operator approximation
Steven Dahdah, Mcgill University -
Novel Mixed-Integer Optimization Approaches for Interpretable SVMs
Federico D'onofrio, Sapienza University of Rome
Stream 2e: Approximation and Online Algorithms
FB295 — Algorithms with Predictions
-
Fair Secretaries with Unfair Predictions
Eric Balkanski, Columbia University -
Incremental Topological Ordering and Cycle Detection with Predictions
Benjamin Moseley, Carnegie Mellon University -
Algorithms with Prediction Portfolios
Thomas Lavastida, The University of Texas at Dallas -
Energy-Efficient Scheduling with Predictions
Clifford Stein, Columbia University
FB225 — Fairness via Optimization Modeling and Approximation Algorithms
-
Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints
Varun Suriyanarayana, Cornell University -
Assortment Optimization with Visibility Constraints
Marouane Ibn Brahim, Cornell Tech -
Fairness, Randomization, and Approximation Algorithms
Aravind Srinivasan, University of Maryland -
Algorithmic Tools for Redistricting: Fairness via Analytics
David Shmoys, Cornell University
Stream 2f: Computational Discrete and Integer Optimization
FB268 — Integer Programming Applications in Mobility and Traffic
-
On the Split Closure of the Periodic Timetabling Polytope
Niels Lindner, Freie Universität Berlin -
Integrated Periodic Event Scheduling and Infrastructure Assignment: approaches via Cyclic Orders and Graph Matchings
Enrico Bortoletto, Zuse Institute Berlin -
A Flexible Model for Integrated Line Planning and Periodic Timetabling with Track Choice in Practice
Berenike Masing, Zuse Institute Berlin -
The Approximation Error Caused by Linearizing Charging Behavior for Electric Vehicle Scheduling Problems
Fabian Löbel, Zuse Institute Berlin
Stream 2g: Constraint Programming
FB242 — Learning and Explaining Constraints
-
Domain-Independent Dynamic Programming
J. Christopher Beck, University of Toronto -
Lazy MIP Solving with Methods from SAT
Alexander Tesch, Bool AI -
Automated Streamlining for Constraint Satisfaction Problems.
Ian Miguel, University of St Andrews -
Query-Based Constraint Acquisition
Nadjib Lazaar, LIRMM, University of Montpellier, CNRS
Stream 3a: Continuous Stochastic Programming
FB936 — Continuous Stochastic Programming 3
-
Stable Matching with Contingent Priorities
Federico Bobbio Bobbio, University of Montreal -
On the Chance-Constrained Optimization with Gaussian Mixture Models
Shibshankar Dey, Industrial Engineering And Management Sciences, Northwestern University
Stream 3c: Robust and Distributionally Robust Optimization
FB184 — Exact methods for robust nonlinear optimization
-
RPT for robust nonlinear optimization problems
Danique De Moor, Massachusetts Institute of Technology -
Reformulation-Perspectification Technique for problems with conic uncertainty sets
Dick Den Hertog, University of Amsterdam -
An exact method for a class of robust nonlinear optimization problems
Thororis Koukouvinos, Operations Research Center, Massachusetts Institute of Technology, United States
FB104 — Data-driven Robust Optimization
-
Conformal Inverse Optimization
Bo Lin, University of Toronto -
Learning Decision-Focused Uncertainty Sets in Robust Optimization
Irina Wang, Princeton University -
Neur2RO: Neural Two-Stage Robust Optimization
Justin Dumochelle, University of Toronto
FB122 — Optimization with Marginals and Moments
-
Distributionally robust optimization through the lens of submodularity
Karthik Natarajan, Singapore University of Technology And Design -
When submodularity meets pairwise independence
Arjun Ramachandra, IIM Bangalore -
** CANCELLED ** Convex Optimization for Bundle Size Pricing Problem
Hailong Sun, Antai College Of Economics And Management, Shanghai Jiao Tong University -
Progresses in Modeling and solving distributional robust optimization problems
He Simai, Shanghai Jiao Tong University
Stream 3d: Multi-stage Stochastic Programming and Reinforcement learning
FB109 — Advances in multi-stage stochastic programming
-
Multi-Stage Stochastic Programming for Integrated Hurricane Evacuation and Logistics Planning
Yongjia Song, Clemson University -
Multistage Chance-Constrained Programming
Hamed Rahimian, Clemson University -
Interpretable Vaccine Administration and Inventory Replenishment Policies via Smooth-in-Expectation Decision Rules
Merve Bodur, University of Edinburgh -
Solving multistage equilibrium problems: the Krusell-Smith model
Bernardo Pagnoncelli, Skema Business School
Stream 3e: Data-driven optimization
FB141 — Advances in data-driven decision making
-
Learning Optimal Classification Trees Robust to Distribution Shifts
Nathan Justin, University of Southern California -
Randomized Nyström Preconditioned Interior Point-Proximal Method of Multipliers (IP-PMM)
Ya Chi Chu, Stanford University -
On the Equivalence and Performance of Distributionally Robust Optimization and Robust Satisficing Models in OM Applications
Long He, George Washington University -
Randomized policy optimization for high-dimensional optimal stopping
Velibor Misic, Ucla
Stream 4b: Transportation and logistics
FB172 — Demand-based and stochastic urban transportation planning
-
Competing on Emissions Charges
Gianmarco Andreana, University of Bergamo -
Hub Transportation Problem with Chance Constrained Due Dates
Öykü Naz Attila, Polytechnique Montreal -
** CANCELLED ** Collaborative Optimization of Rolling Stock Allocation and Timetable Coordination in a Multi-Modal Rail Network: MILP Formulation and Decomposition-Based Algorithm
Jiateng Yin, Beijing Jiaotong University -
A Reinforcement Learning Approach for Dynamic Rebalancing in Bike-Sharing Systems
Jiaqi Liang, Polytechnique Montreal
FB164 — Humanitarian Logistics
-
A Mutual Catastrophe Insurance Framework for Horizontal Collaboration in Prepositioning Strategic Reserves
Hani Zbib, University of Quebec In Montreal -
Mitigating fire risk towards critical and residential structures near a high ignition area using Critical Node Detection
Vittorio Nicoletta, HEC Montréal -
The Value of Demand Prediction for Improved Food Security
Alborz Hassanzadeh, HEC Montréal -
A bilevel optimization approach for shelter network design and evacuation planning problem: An application to flood preparedness in Haiti
Maedeh Sharbaf, HEC Montréal
Stream 4d: Energy and Environment
FB959 — Energy and Environment 4
-
Efficient hydrogen infrastructure design using JuMP and convex approximations
Truls Flatberg, SINTEF -
Applications of Optimization in Land Conservation
Hande Benson, Drexel University
Stream 4g: High performance implementation and quantum computing
FB165 — A glimpse of computational optimization at Google III
-
ViolationLS: Constraint-Based Local Search in CP-SAT
Toby Davies, Google -
MathOpt: Solver independent modeling and execution independent solving in Google's OR-Tools
Ross Anderson, Google -
Google's Operations Research API
Daniel Duque, Google -
Duality and decomposition in OR-Tools' MathOpt
Juan Pablo Vielma, Google
Stream 5c: Special sessions
FB821 — Special session
-
Semidefinite representable reformulations for two variants of the trust-region subproblem
Boshi Yang, Clemson University -
Smoothing approximation approaches for solving nonlinear random optimization problems in finite and infinite dimensional spaces
Abebe Geletu, German Research Chair, Aims Rwanda -
Buffer Fr3
To Be Announced , GERAD -
Buffer Fr4
To Be Announced , GERAD