Personal Schedules Are Now Available
To create your personal schedule, sign in to your profile
Stream 1a: Nonlinear Programming I
TA40 — Advances in Large-Scale Nonlinear Optimization II
-
First-Order Algorithms for Nonconvex Min-Max Problems with Cohypomonotonicity
Stephen Wright, University of Wisconsin Madison -
** CANCELLED ** Efficient Gradient Tracking Algorithmic Frameworks for Decentralized Optimization
Raghu Bollapragada, University of Texas at Austin -
Randomized and Stochastic Methods for Fixed-Point and Root-Finding Problems
Quoc Tran Dinh, Department of Statistics And Operations Research, The University of North Carolina At Chapel Hill -
Stochastic Proximal-Gradient Methods with Nonlinear Constraints
Daniel Robinson, Lehigh University
TA59 — Advances in numerical methods for large scale nonlinear optimization and applications II
-
Riemannian trust-region methods for strict saddle functions with complexity guarantees
Florentin Goyens, University Paris Dauphine Psl -
A stochastic Hessian-free trust-region method for statistical learning
Jeremy Rieussec, University of Montreal -
Implementation and experiments of an augmented Lagrangian method with first-order information
Ernesto Birgin, University of São Paulo -
Spectral Stochastic Gradient Method with Additional Sampling
Ilaria Trombini, Università Degli Studi Di Ferrara
TA31 — Advances in Nonconvex Optimization
-
From Stability to Chaos: Analyzing Gradient Descent Dynamics in Quadratic Regression
Xuxing Chen, University of California, Davis -
Optimal Low-Rank Matrix Completion: Semidefinite Relaxations and Eigenvector Disjunctions
Ryan Cory Wright, Imperial College London -
On the Partial Convexification of the Low-Rank Constrained Optimization
Weijun Xie, Georgia Institute of Technology -
A Parametric Approach for Solving Convex Quadratic Optimization with Indicators Over Trees
Salar Fattahi, University of Michigan
Stream 1b: Global Optimization
TA324 — Global Optimization at work
-
GPU-Accelerated Deterministic Global Optimization
Robert Gottlieb, University of Connecticut -
Centrality of shortest paths: algorithms and complexity results
Dmytro Matsypura, The University of Sydney -
Simple Randomized Rounding for Max-Min Eigenvalue Augmentation
Jourdain Lamperski, University of Pittsburgh -
Convexification of optimization problems involving the Euclidean norm
Nikolaos V. Sahinidis, Georgia Institute of Technology
Stream 1c: Nonsmooth Optimization
TA65 — Nonlinear optimization problems
-
Convergence and error estimation of smoothing consensus-based optimization algorithm for nonsmooth nonconvex optimization
Wei Bian, Harbin Institute of Technology -
On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
Wenjing Li, Harbin Institute of Technology -
A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
Lei Yang, Sun Yat Sen University -
** CANCELLED ** An iteratively reweigthed second-order method for nonconvex regularization
Hao Wang, Shanghaitech University
TA112 — Advances in Variational Analysis and Nonsmooth Optimization I
-
Variational theory and algorithms for a class of asymptotically approachable nonconvex problems
Ying Cui, University of California Berkeley -
Approximations of Rockafellians, Lagrangians, and Dual Functions
Johannes Royset, University of Southern California -
Heaviside Composite Optimization: Continuous meets Discrete
Jong Shi Pang, University of Southern California -
Computing Wasserstein Barycenter via operator splitting: the method of averaged marginals
Daniel Mimouni, Mines Paris
Stream 1d: Semi-Definite Programming
TA138 — Moment, Polynomial and Tensor Optimization - Part 1
-
Global stability of first-order methods for coercive tame functions
Lexiao Lai, Columbia University -
** CANCELLED ** Certifying nonnegative functions on finite sets via Fourier SOS
Ke Ye, Chinese Academy Of Sciences -
Generalized Nash equilibrium problems with Quasi-linear constraints
Jiyoung Choi, University of California San Diego -
Solving robotic control problems with safety constraints using moment and SOS relaxations
Xindong Tang, Hong Kong Baptist University
Stream 1e: Variational Analysis, Variational Inequalities and Complementarity
TA313 — Algorithms for optimization, monotone inclusions and variational inequalities 1
-
On a result by Baillon, Bruck, and Reich
Heinz Bauschke, UBC Okanagan -
On the Bredies-Chenchene-Lorenz-Naldi algorithm
Shambhavi Singh, University of British Columbia Okanagan -
The proximal point algorithm without monotonicity
Russell Luke, Georg August University of Goettingen -
Fast continuous time methods for monotone equations
Radu Ioan Bot, University of Vienna
Stream 1f: Random Methods for Continuous Optimization
TA130 — Fast randomized algorithms for distributed optimization
-
CMA Light: a minibatch algorithm for large-scale non-convex finite sum optimization
Corrado Coppola, Sapienza University of Rome -
On adaptive stochastic heavy ball momentum for solving linear systems
Jiaxin Xie, Beihang University -
Optimal gradient tracking for decentralized optimization
Ming Yan, The Chinese University of Hong Kong, Shenzhen -
Communication-efficient distributed optimization algorithms
Laurent Condat, KAUST
Stream 1g: Derivative-free and Simulation-based Optimization
TA306 — Large-scale and Parallel DFO
-
A derivative-free approach to partitioned optimization
Pierre Yves Bouchet, Polytechnique Montréal, GERAD -
Blockwise direct search method
Zaikun Zhang, The Hong Kong Polytechnic University -
Using concurrent objective evaluations in derivative-free optimization
Jeffrey Larson, Argonne National Laboratory -
A direct-search method for decentralized derivative-free optimization
Youssef Diouane, Polytechnique Montréal
Stream 1h: Optimal Control, PDE Constrained Optimization, and Multi-level Methods
TA90 — Nonsmooth PDE Constrained Optimization 2
-
A hybrid physics-informed neural network based multiscale solver as a PDE constrained optimization problem
Michael Hintermüller, Weierstrass Institute Berlin -
Decomposition in Integer Optimal Control with Total Variation Regularization
Paul Manns, Tu Dortmund University -
Integer linear programming for two-dimensional trust-region subproblems arising in integer optimal control
Marvin Severitt, Tu Dortmund University -
Integer Optimal Control Problems with TV regularization on Multi-dimensional Domains
Annika Schiemann, Tu Dortmund University
Stream 2a: Mixed Integer Linear Programming
TA188 — Network-flow based MIP formulations
-
A Branch-and-Price Approach for a Consolidation-based Formulation of the Scheduled Service Network Design Problem
Mike Hewitt, Loyola University Chicago -
Exact Methods For Electric Routing Operations: A Subpath-Based Pricing Problem Decomposition
Sean Lo, MIT -
A network-flow formulation for a scheduling problem in the car industry
François Clautiaux, Université De Bordeaux -
Dynamic programming based arc-flow formulations for cutting and packing problems
Luis Marques, INRIA Center of University of Bordeaux
Stream 2b: Mixed Integer Nonlinear Programming
TA152 — Solving ACOPF problems
-
AC-Unit Commitment: Capturing Losses
Hassan Hijazi, Gurobi -
New Advances in Solving Large-Scale Unit-Commitment-AC-OPF Problem
Andy Sun, Massachusetts Institute of Technology -
Fusing AI and Optimization for Security-Constrained Economic Dispatch
Pascal Van Hentenryck, Georgia Tech -
Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF
Matias Villagra, Columbia University
Stream 2c: Combinatorial Optimization and Graph Theory
TA263 — Graph Coloring
-
Column Generation for Generalized Min-Cost Flows
Jonas Alker, Tu Darmstadt -
Pairwise disjoint perfect matchings in r-graphs
Isaak H. Wolf, Paderborn University -
Injective Edge Colouring Some Classes of Sparse Graphs
Alexander Clow, Simon Fraser University -
Sets of $r$-graphs that color all $r$-graphs
Eckhard Steffen, Paderborn University
TA922 — Combinatorial Optimization and Graph Theory 2
-
Preference-based Constrained Optimization
Malek Mouhoub, University of Regina -
Exact approaches for solving interdependent multi-stage interdiction games: Applications in Communication Problems
Jose Walteros, University At Buffalo -
Sparse factorization of the square all-ones matrix of arbitrary order
Edward Duc Hien Nguyen, Rice University -
The Edge-based Contiguous p-median Problem with Connections to Territorial Districting
Adolfo Escobedo, North Carolina State University
Stream 2d: Machine Learning and Discrete Optimization
TA297 — Optimization for Safe and Private Machine Learning
-
A Framework for Data-driven Explainability in Mathematical Optimization
Frauke Liers, Friedrich Alexander Universität Erlangen Nürnberg -
Get Off The Hype Train: Why Using Neural Networks Can Be Very Risky
Robert Bassett, Naval Postgraduate School -
OR with a White Hat : Evidencing Privacy Vulnerabilities in ML Models
Thibaut Vidal, Polytechnique Montréal -
SMLE: Safe Machine Learning via Embedded Overapproximation
Matteo Francobaldi, University of Bologna
Stream 2e: Approximation and Online Algorithms
TA229 — Algorithms for Pricing and Assortment Optimization
-
Submodular Order Functions and Their Applications
Rajan Udwani, UC Berkeley -
Optimizing and Learning Assortment Decisions in the Presence of Platform Disengagement
Mika Sumida, University of Southern California -
Learning to Price Under Competition for Multinomial Logit Demand
Sanjay Mehrotra, Northwestern University -
Maximum Load Assortment Optimization
Omar El Housni, Cornell University
TA930 — Approximation and Online Algorithms 1
-
Online Matching on 3-Uniform Hypergraphs
Danish Kashaev, Centrum Wiskunde & Informatica -
Nearly optimal node selection in the explorable heap model
Sander Borst, CWI -
TSP-T3CO: A Classification Scheme for Variants of the Traveling Salesman Problem
Andreas Karrenbauer, Max Planck Institute For Informatics -
Reliable Adjustable Planning in Case of Dynamically Arriving Information: Example of E-Commerce Warehouses
Alena Otto, University of Passau
Stream 2f: Computational Discrete and Integer Optimization
TA269 — Solver Software I
-
What’s New in FICO Xpress Solver?
Timo Berthold, Fair Isaac Deutschland Gmbh -
What's new in Gurobi 11
Michael Winkler, Gurobi Optimization -
Enhancing the HiGHS MIP solver
Julian Hall, University of Edinburgh -
Recent Progress in the Cardinal Optimizer
Nils Christian Kempke, Cardial Operations/Copt Gmbh
Stream 3a: Continuous Stochastic Programming
TA115 — Advances in First-Order Methods for Continuous and Stochastic Optimization
-
Asymptotic Normality and Optimality in Nonsmooth Stochastic Optimization
Liwei Jiang, Cornell University -
A simple uniformly optimal method without line search for convex optimization
Tianjiao Li, Georgia Institute of Technology -
Universal First-Order Methods for Convex Optimization Problems
Jiaming Liang, University of Rochester -
Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization
Jimmy Zhang, IE, Purdue University
Stream 3c: Robust and Distributionally Robust Optimization
TA99 — Robust Optimization and Machine Learning 1
-
Platform Design for the First Mile of Commodity Supply Chains
Sergio Camelo, Stanford University -
An MILP-Based Solution Scheme for Factored and Robust Factored Markov Decision Processes
Man Chung Yue, The University of Hong Kong -
Wasserstein Adversarial Logistic Regression with Synthetic Data
Aras Selvi, Imperial College London -
End-to-end Conditional Robust Optimization
Abhilash Chenreddy, HEC Montréal
TA170 — Recent Advances in the Theory of Stochastic and Robust Optimization
-
Robust Data-driven Prescriptiveness Optimization
Angelos Georghiou, University of Cyprus -
On the Adversarial Robustness of Benjamini-Hochberg
Louis Chen, Naval Postgraduate School -
Fourth-order Marginal Moment Model: Reformulations and Applications
Li Xiaobo, National University of Singapore
TA938 — Robust and Distributionally Robust Optimization 1
-
Cut-Generation Algorithms for Uncertain Unit Commitment under Mixed-Information Models
Vitor Luiz Pinto De Pina Ferreira, école Des Ponts Paristech -
Distributionally robust optimization using optimal transport for Gaussian mixture models
Zukui Li, University of Alberta -
Robust approaches for the Kidney Exchange Problem
Matteo Petris, Essec Business School
Stream 3d: Multi-stage Stochastic Programming and Reinforcement learning
TA53 — Approximation of Large Scale Structured Markov Decision Processes in Operations Applications
-
Combinatorial Fluid Models for Routing
Andre Augusto Cire, University of Toronto -
Structure Aware Lagrangian Relaxations for Weakly Coupled Markov Decision Processes
Selvaprabu Nadarajah, University of Illinois Chicago -
Unit Commitment without Commitment: A Dynamic Framework for Managing an Integrated Energy System Under Uncertainty
David Brown, Duke University -
Faster Approximate Dynamic Programming by Freezing Slow States
Daniel Jiang, Meta
Stream 3e: Data-driven optimization
TA158 — Statistical and Computational Aspects of Robust Estimation
-
Outlier-Robust Wasserstein DRO
Soroosh Shafiee, Cornell -
Coherent Wasserstein Distributionally Robust Optimization
Jonathan Li, University of Ottawa -
Universal Gradient Descent Ascent Method for Smooth Minimax Optimization
Taoli Zheng, The Chinese University of Hong Kong -
The out-of-sample prediction error of the square-root lasso and related estimators
Cynthia Rush, Columbia University
TA134 — Robust or Go Bust: Tales in Distributionally Robust and Data-Driven Optimization
-
** Permuted with Kuhn's talk at 9:30** Distributionally Robust Linear Quadratic Control
Dan Iancu, Stanford Graduate School Of Business -
Randomized Assortment Optimization
Wolfram Wiesemann, Imperial College London -
** Permuted with Iancu's talk at 8:30** Wasserstein Distributionally Robust Optimization with Heterogeneous Data Sources
Daniel Kuhn, EPFL -
Learning Optimal and Fair Policies for Online Allocation of Scarce Societal Resources from Data Collected in Deployment
Cagil Kocyigit, University of Luxembourg
Stream 4b: Transportation and logistics
TA274 — Large Scale Optimisation in Transportation
-
A Branch-and-Price Algorithm for Multiple Depot Bus scheduling Problem in Public Transit Systems
Nadia Rasouli, Phd Candidate -
Considering regularity in the aircrew pairing problem
Frédéric Quesnel, Université du Québec à Montréal -
Accelerated insight into the crew rostering problem with machine learning methods
Philippe Racette, école Polytechnique De Montréal -
Solving the Crew Split Problem: Innovative Team Formation Strategies for the Crew Pairing Problem
Mohand Ryad Chelbani, Polytechnique Montréal
TA192 — Network Design for Transportation Planning III
-
Design for integrated Freight and Passenger Transportation: Some recent advances
Tom Van Woensel, Eindhoven University of Technology -
A Construction Matheuristic for Two-Tier Synchronized City Logistics
Julia Lange, University of Kaiserslautern Landau -
A multi – commodity location – network design problem with vehicle selection in City Logistics
Francesco Contu, University of Cagliari -
The Two-Echelon Multicommodity Location-Routing Problem with Stochastic and Correlated Demands
Walter Rei, CIRRELT And Université du Québec à Montréal
Stream 4d: Energy and Environment
TA117 — Advances in generation, transmission and distribution modelling
-
RALPH - Solving the unit commitment problem under hydraulic and transient stability constraints
Alexandre Besner, Hydro Québec -
Tight Big-Ms for Optimal Transmission Switching
Salvador Pineda, Universidad De Málaga -
Application of operational research in Hydro Quebec distribution system planning
Mihajlo Curcic, Hydro Quebec -
Optimizing physical and financial assets using SDDP
Yves Alain Mbeutcha, Hydro Québec, Canada
TA956 — Energy and Environment 1
-
Differentially Private Distributed Optimization with Constraints
Minseok Ryu, Arizona State University -
Uniform Convergence of Kernel Estimators
Paul Dommel, Tu Chemnitz -
An Interval-based Stochastic Unit Commitment Model Under Demand Uncertainty
Hojin Jung, Seoul National University -
Integrated energy system planning under short-term and long-term uncertainty: Modelling and algorithms
Hongyu Zhang, Norwegian University of Science And Technology
Stream 4i: Industrial applications
TA276 — Large Scale Supply-Chain Network Design I
-
Relay-Hub Network Design for Consolidation Planning Under Demand Variability
Mathieu Dahan, Georgia Institute of Technology -
Dynamic discretization discovery for region-based networks
Jochen Koenemann, Amazon -
Fast Combinatorial Algorithms for Efficient Sortation
Madison Van Dyk, University of Waterloo; Modeling And Optimization, Amazon.Com -
Designing Optimization Software for Use Case Scalability
Semih Atakan, Amazon.Com
Stream 5c: Special sessions
TA280 — A.W. Tucker Prize
-
A.W. Tucker Prize
Miguel Anjos, University of Edinburgh -
Tucker Prize Finalists
Miguel Anjos, University of Edinburgh