Personal Schedules Are Now Available
To create your personal schedule, sign in to your profile
Stream 1a: Nonlinear Programming I
ThA42 — Advances in LargeScale Nonlinear Optimization IV

A stochastic moving ball approximation method for smooth convex constrained minimization
Ion Necoara, National University of Science And Technology Politehnica Bucharest 
Randomized Algorithms for Variational Inequality Problems
Angelia Nedich, Arizona State University 
Retrospective Approximation for Stochastic Constrained Problems Using Sequential Quadratic Programming
Shagun Gupta, University of Texas at Austin 
A Double Stepsize Stochastic SQP Method with Complexity Guarantees
Mike O'neill, University of North Carolina
ThA135 — From First to Highorder Methodologies: Recent Advances and Trends III

HSODF: A Homogeneous Framework for SecondOrder Methods
Chuwen Zhang, Shanghai University of Finance And Economics 
Descent properties of an Anderson accelerated gradient method with restarting
Andre Milzarek, The Chinese University of Hong Kong, Shenzhen 
Online Learning Guided QuasiNewton Methods: Improved Global Nonasymptotic Guarantees
Ruichen Jiang, UT Austin 
Adamfamily Methods for Nonsmooth Optimization with Convergence Guarantees
Nachuan Xiao, National University of Singapore
ThA74 — The interplay between optimization, statistics and machine learning I

Sharpness and wellconditioning of nonsmooth convex formulations in statistical signal recovery
Lijun Ding, University of Wisconsin Madison 
Fast Nonconvex Matrix Estimation with Global Optimality Certification
Jialun Zhang, University of Illinois Urbana Champaign 
cuPDLP: A GPU implementation of restarted primaldual hybrid gradient for linear programming
Jinwen Yang, University of Chicago 
TopK Ranking with a Monotone Adversary
Cong Ma, University of Chicago
ThA19 — Theoretical advances in nonconvex optimization

Practical session : Model and solve a nonlinear optimization problem with Artelys Knitro
Carlyle Deligny, Artelys Canada Inc 
The kcut problem in hypergraphs, a computational study
Mourad Baiou, CNRS 
Fairness in Submodular Maximization over a Matroid Constraint
Marwa El Halabi, Samsung Sait Ai Lab 
** CANCELLED ** An antipodal theorem for nonlinear optimization problems
Hidefumi Kawasaki, Kyushu University
Stream 1b: Global Optimization
ThA24 — Recent Advances in Global Optimization

On a Penalty Weighted Tchebycheff Scalarizing Function for Multiobjective Optimization
Ana Rocha, University of Minho 
Investigating polytopal global optimization branch and bound
Eligius Mt Hendrix, Universidad De Málaga 
Column generation for multistage stochastic mixedinteger nonlinear programs with discrete state variables
Tushar Rathi, University of Minnesota 
Advances in edgeconcave relaxation based global optimization
Faruque Hasan, Texas A&M University
Stream 1c: Nonsmooth Optimization
ThA30 — Nonsmooth nonconvex optimization with geometric structure

Awaystep FrankWolfe algorithm for multiobjective optimization on polytopes
Douglas Soares Goncalves, Universidade Federal De Santa Catarina 
A Nearoptimal Method for Quadratic Constrained Composite Nonconvex Nonsmooth Problems
Wei Liu, Rensselaer Polytechnic Institute 
Global and local convergence guarantees for boundedrank optimization with a desingularization geometry
Quentin Rebjock, EPFL
ThA56 — Optimization with Projections

Projectional coderivatives with applications
Xiaoqi Yang, The Hong Kong Polytechnic University 
Sorting Functions for Sparse Projection with Applications to Sparse Optimization
Jinglai Shen, University of Maryland Baltimore County 
A projection algorithm for nonlocal lowrank tensor models with orthogonal constraints
Xiaoxia Liu, Hong Kong Polytechnic University
Stream 1d: SemiDefinite Programming
ThA139 — Moment, Polynomial and Tensor Optimization  Part 2

Symmetric Tensor Decompositions and Gaussian Mixture Models
Zi Yang, University At Albany, Suny 
Moment Estimation of Nonparametric Mixtures Through Implicit Tensor Decomposition
Joe Kileel, UT Austin 
Spectral Methods for Polynomial Optimization
Elvira Moreno, Caltech
ThA214 — On SDP relaxations for combinatorial optimization problems

Combinatoric Derivations and Sidorenko's Conjecture
Daniel Brosch, University of Klagenfurt 
Exploiting lowrank SDP methods for solving MaxCut
Jan Schwiddessen, University of Klagenfurt 
Using the ALPS framework to run the BiqCrunch binary quadratic solver on a computer cluster
Nathan Krislock, Northern Illinois University 
Sums of squares and Sidorenko's conjecture
Annie Raymond, University of Massachusetts, Amherst
Stream 1e: Variational Analysis, Variational Inequalities and Complementarity
ThA354 — Recent advances in Variational Inequalities and Complementarity

The radius of statistical efficiency
Mateo Diaz, Johns Hopkins University 
The Role of Subgradients in SecondOrder Variational Analysis
Ebrahim Sarabi, Miami University 
Polyhedral Newtonmin algorithms for complementarity problems
Jean Pierre Dussault, Université De Sherbrooke 
LevenbergMarquardt globalization of the polyhedral Newtonmin algorithm for complementarity problems
Baptiste Plaquevent Jourdain, INRIA Paris, Université De Sherbrooke
ThA912 — Variational Analysis, Variational Inequalities and Complementarity 2

On projections onto Parametric Polyhedral Sets
Krzysztof Rutkowski, Cardinal Stefan Wyszyński University In Warsaw 
DouglasRachford splitting algorithm with line search
Lingling Xu, School Of Mathematical Science, Nanjing Normal University 
PrimalDual Methods with Adjoint Mismatch  Existence of Stationary Points, Convergence and Error Bounds
Felix Schneppe, University of Bremen 
LastIterate Convergence of SaddlePoint Optimizers via HighResolution Differential Equations
Tatjana Chavdarova, Cispa And Saarland University
Stream 1f: Random Methods for Continuous Optimization
ThA128 — Adaptive, Linesearch, and ParameterFree Stochastic Optimization I

GlobalLocal Smoothness: Line Search can really help! Really!
Mark Schmidt, UBC 
What is the right extension of Polyak's stepsize to mirror descent?
Ryan D'orazio, Mila, Université De Montréal 
Scaling Law: Finding Compute Optimal Curves on a Simple Model with SGD
Courtney Paquette, Mcgill University 
Generalized Polyak Step Size for First Order Optimization with Momentum
Xiaoyu Wang, The Hong Kong University of Science And Technology
Stream 1g: Derivativefree and Simulationbased Optimization
ThA325 — DFO based on Approximations to Derivatives 1

Is building firstorder simulation oracles really worth it?
Sara Shashaani, North Carolina State University 
Adaptive stochastic subspace descent
Killian Wood, University of Colorado Boulder 
SelfCorrecting DFO Algorithm: An Attempt at a Convergence Rate
Jiaqi Wang, Cornell University 
Derivativefree stochastic optimization via adaptive sampling strategies
Stefan M. Wild, Lawrence Berkeley National Laboratory
Stream 1h: Optimal Control, PDE Constrained Optimization, and Multilevel Methods
ThA361 — Analysis of Algorithms for PDE Constrained Optimization 2

Sensor path planning for optimal experimental design
Thomas Lynn, Argonne National Laboratory 
Lowrank Gradient Flow – a First Order Algorithm for Nonconvex Optimization
Andrei Draganescu, University of Maryland, Baltimore County 
Optimal Experimental Design for Universal Differential Equations
Christoph Plate, Otto Von Guericke University Magdeburg 
Lazified Generalized Conditional Gradient
Arsen Hnatiuk, Humboldt Universität Zu Berlin
Stream 2a: Mixed Integer Linear Programming
ThA237 — Recent Advances in Combinatorial Optimization

Lagrangian relaxation and duality for multiobjective integer programming
Saumya Sinha, University of Minnesota 
On the Number of Degenerate Simplex Pivots
Kirill Kukharenko, Otto Von Guericke University Magdeburg 
A betterthank/2approximation for weighted kSet Packing
Meike Neuwohner, London School Of Economics And Political Science
Stream 2b: Mixed Integer Nonlinear Programming
ThA77 — Polynomial Optimization Algorithms and Applications

Parameter estimation in ODEs: assessing the potential of local and global solvers
ángel Manuel González Rueda, University of Santiago De Compostela 
Domain reduction techniques in polynomial optimization
Ignacio Gómez Casares, University of Santiago De Compostela 
Learning to Accelerate the Global Optimization of QuadraticallyConstrained Quadratic Programs
Rohit Kannan, Virginia Tech 
Strong and fast SDP bounds for water network problems
Bissan Ghaddar, Ivey Business School
Stream 2c: Combinatorial Optimization and Graph Theory
ThA924 — Combinatorial Optimization and Graph Theory 4

A 2/3approximation algorithm for the maximum weight spanning star forest problem
Viet Hung Nguyen, LIMOS Clermont Auvergne University 
On the CongruencyConstrained Matroid Base
Siyue Liu, Carnegie Mellon University 
Combinatorial algorithms for large household allocation problems
Lucas Moschen, Trier University 
Totally equimodular matrices
Roland Grappe, University Paris Dauphine, Psl Lamsade
Stream 2d: Machine Learning and Discrete Optimization
ThA211 — Explainable Artificial Intelligence and Mathematical Programming

ODTlearn: A Python Package for Learning Optimal Decision Trees for Prediction and Prescription
Patrick Vossler, Stanford University 
Finding Regions of Counterfactual Explanations via Robust Optimization
Ilker Birbil, University of Amsterdam 
Learning Optimal Prescriptive Trees from Observational Data
Nathanael Jo, Massachusetts Institute of Technology 
Counterfactual Explanations for Linear Optimization
Jannis Kurtz, University of Amsterdam
Stream 2e: Approximation and Online Algorithms
ThA293 — Approximation Algorithms for the Traveling Salesman Problem

A Lower Bound for the Max Entropy Algorithm for the Traveling Salesman Problem
Billy Jin, Cornell University 
Approximation Algorithms for Traveling Salesman Problems
Jens Vygen, University of Bonn 
Small additive error for unsplittable multicommodity flow in outerplanar graphs
Richard Shapley, Cornell 
A 4/3Approximation Algorithm for HalfIntegral Cycle Cut Instances of the TSP
David Williamson, Cornell University
Stream 2f: Computational Discrete and Integer Optimization
ThA343 — Decomposition Methods

A scalable Master Problem in Dual Decomposition of Stochastic MIP
Kibaek Kim, Argonne National Laboratory 
** CANCELLED ** A RowandColumn Generation Approach to MinSum JobShop Scheduling
Marco Lübbecke, Rwth Aachen University 
Decomposition method for a capacitated multivehicle covering tour problem with intermediate facilities
Antoine Legrain, Polytechnique Montreal 
Integer programming column generation: Accelerating branchandprice for set covering, packing, and partitioning problems
Elina Rönnberg, Linköping University
Stream 3a: Continuous Stochastic Programming
ThA101 — Decisionmaking under Preference Uncertainty

Risk Budgeting Allocation for Dynamic Risk Measures
Silvana Pesenti, University of Toronto 
Nonparametric Inverse Optimization: Theory and Applications
Reza Valimoradi, University of Ottawa 
Preference Ambiguity and Robustness in Multistage Decision Making
Huifu Xu, The Chinese University of Hong Kong 
Multiattribute Preference Robust Optimization with QuasiConave Choice Functions
Wenjie Huang, The University of Hong Kong
Stream 3b: Discrete Stochastic Programming
ThA937 — Discrete Stochastic Programming 1

Robust Optimality of Bundling I.I.D. Goods Beyond Finite Variance
Pieter Kleer, Tilburg University 
The SAA Method for TwoStage Stochastic Programs with Endogenous Uncertainty
Maria Carolina Bazotte Corgozinho, Polytechnique Montreal 
A Riskaware LocationAllocationPricing Problem with Stochastic PriceSensitive Demands
Maryam Daryalal, HEC Montréal 
A Decomposition Method for Network Revenue Management with Dynamic Pricing and Bundles
Emanuele Concas, ENPC
Stream 3c: Robust and Distributionally Robust Optimization
ThA174 — Innovative RO Techniques in Transportation and Location Science

Tractable smart predict and optimize in the nonrealizable case
Omar Bennouna, Massachusetts Institute of Technology 
Robust Lane Covering Problem
İhsan Yanıkoğlu, Assoc. Prof. 
Distributionally Robust Optimization with Multimodal DecisionDependent Ambiguity Sets
Beste Basciftci, University of Iowa 
Electric Bus Fleet Scheduling under Travel Time and Energy Consumption Uncertainty
Farzad Avishan, HEC Montréal
ThA277 — Optimization  Machine Learning Interfaces

Equivalent reformulation of multistage robust optimization under timevarying exogenous uncertainty with an application to optimal bidding in energy markets
Mirai Tanaka, The Institute of Statistical Mathematics 
General Polyhedral Approximation of TwoStage Robust Linear Programming
Tim Niemann, Tu Braunschweig 
Multipurchase behavior: Modeling, estimation, and optimization
Deeksha Sinha, Meta 
A Robust Approach to Classification and TruthValidation: Incorporating Human and Large Language Model Decision Making
Chaithanya Bandi, NUS Business School
Stream 3d: Multistage Stochastic Programming and Reinforcement learning
ThA246 — Statistical Learning, Optimization and Stochastic Programming for Reinforcement Learning

HyperAgent: Advancing Scalable Exploration through Fast Uncertainty Estimation in RL
Yingru Li, The Chinese University of Hong Kong, Shenzhen 
VarianceDependent Regret Bounds for Nonstationary Linear Bandits
Dongruo Zhou, Indiana University 
Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo
Haque Ishfaq, Mcgill University / Mila 
Rethinking of Deep RL: Learning the Target Network in Function Space
Ming Yin, Princeton University
Stream 4b: Transportation and logistics
ThA948 — Transportation and logistics 4

A Matheuristic for the Stochastic Production Routing Problem with Adaptive Routing and Service Levels
Ali Kermani, HEC Montréal 
Valid Inequalities for the Vehicle Routing Problem with Drones
Faiz Hamid, Indian Institute of Technology Kanpur
ThA949 — Transportation and logistics 5

An exact branchandpriceandcut algorithm for a practical dialaride problem
Mohammad Karimi, Department of Mathematics And Industrial Engineering, Polytechnique Montreal / Cirrelt 
A ColumnGeneration Algorithm for the Intercity Electric Coach Scheduling Problem
Malte Billen, The University of Edinburgh 
A unifying framework for selective routing problems
Cagla Dursunoglu, Bilkent University
Stream 4c: Scheduling and manufacturing
ThA954 — Scheduling and manufacturing 3

Fair Assortment Optimization for an Online Fashion Retailer in the Presence of Size Substitution Effect
Alireza Alavi, Phd Student 
Optimizing a cellular solid compression problem via the NOMAD blackbox optimizer
Paul Patience, Polytechnique Montréal 
A Nested LogicBased Benders Decomposition for the MultiShop Car Resequencing Problem with A Painted Body Storage
Xinyi Guo, Tsinghua University
Stream 4d: Energy and Environment
ThA46 — Optimization Methods for Renewable Power Systems

PrivacyPreserving Decentralized Local Electricity Markets
Lesia Mitridati, Technical University of Denmark 
Data Valuation in Datadriven Stochastic Optimization
Juan M. Morales, University of Malaga 
Hierarchical FeedbackBased Optimization of Distributed Energy Resources in Distribution Grids
John W. Simpson Porco, University of Toronto 
Online Interiorpoint Methods for TimeVarying Equalityconstrained Optimization
Antoine Lesage Landry, Polytechnique Montreal, GERAD
ThA204 — Mobile and static battery systems operations and planning

DecisionFocused Learning for Energy Storage Control and Behavior Prediction
Alghumayjan Saud, Columbia University 
Arbitrage and Regulation with Electricity Storage
Dirk Lauinger, MIT 
Optimal Facility Planning for Electric Vehicle Battery Recycling
Matthew Brun, MIT Operations Research Center 
Optimal Planning and Scheduling for a LargeScale Electric Bus Fleet Transition Problem
Robin Legault, Massachusetts Institute of Technology
Stream 4g: High performance implementation and quantum computing
ThA181 — A glimpse of computational optimization at Google II

Active Learning via Densitybased Space Transformation
Hossein Esfandiari, Google Research 
An exponential penalization, network decomposition algorithm for large LPs
Daniel Alejandro Espinoza Gonzalez, Google Research 
Capacity management via network flows with nonlinear transformations at the nodes
Joey Huchette, Google Research 
Networkaware scheduling of large ML workloads
Christian Tjandraatmadja, Google
Stream 4h: Game Theory
ThA256 — Applications of Nash Equilibrium Problems

A Generalized Voting Game for Categorical Network Choices
Yueh Lin, IESEG School Of Management 
Strategy Investments in ZeroSum Games
Raul Garcia, Rice University 
When Simple is NearOptimal in Security Games
Devansh Jalota, Stanford University 
Dynamic pricing and strategic retailers in the energy sector: A multileaderfollower approach
Alexandra Schwartz, Tu Dresden