Personal Schedules Are Now Available
To create your personal schedule, sign in to your profile
Stream 1a: Nonlinear Programming I
WB68 — Numerical Optimization for Machine Learning 2
-
Why Line-Search When You Can Plane-Search?
Betty Shea, University of British Columbia -
Searching for optimal per-coordinate step-sizes with multidimensional backtracking
Frederik Kunstner, UBC -
When Online Learning Meets Stochastic Calculus
Victor Sanches Portella, University of British Columbia -
Don't be so Monotone: Relaxing Stochastic Line Search in Over-Parameterized Models
Leonardo Galli, LMU Munich
WB120 — Non-Convex, Non-Smooth, Stochastic, and High-Performance Computing Approaches
-
Recent advances in the COPT conic optimizer
Joachim Dahl, Cardinal Operations -
** CANCELLED ** Stochastic Structured Nonconvex Optimization in the Absence of Smoothness
Qi Deng, Shanghai Jiao Tong University -
New complexity results on nonconvex nonsmooth optimization
Tianyi Lin, Massachusetts Institute of Technology -
GPU-Centric Algorithm for Non-Linear Programming Problems
Dongdong Ge, Shanghai Jiao Tong University
WB41 — Advances in Large-Scale Nonlinear Optimization III
-
Dynamic optimal combination of forecasting models
Fabian Bastin, Université De Montréal -
On the global convergence of a decomposition algorithm for nonconvex two-stage problems
Andreas Waechter, Northwestern University -
Modified Line Search Sequential Quadratic Methods for Equality-Constrained Optimization with Unified Global and Local Convergence Guarantees
Jiahao Shi, University of Michigan -
Comparing stochastic oracles arizing in robust gradient estimation
Katya Scheinberg, Cornell University
Stream 1b: Global Optimization
WB350 — Optimization on manifolds
-
An optimized composite gradient method for minimizing the gradient mapping
Mihai I. Florea, Uclouvain -
** CANCELLED ** Regularized Stein Variational Gradient Flow
Ye He, Georgia Institute of Technology -
Tangent Subspace Descent via Discontinuous Subspace Selections on Fixed-Rank Manifolds
David Gutman, Texas A&M University -
Randomized Riemannian Submanifold Subgradient Method for Optimization over Stiefel Manifold
Man Cho So, Chinese University of Hong Kong
Stream 1c: Nonsmooth Optimization
WB331 — Advances in First Order Methods
-
A Bestiary of Counterexamples in Smooth Convex Optimization
Jerome Bolte, Toulouse School Of Economics -
First Order Methods for Convex Bi-Level Optimization Problems
Shoham Sabach, Technion Israel Institute of Israel -
Survey Descent and Its Initialization
X.Y. Han, Chicago Booth -
A Unified Framework for Convergence Analysis of Proximal Gradient Methods in Nonsmooth Nonconvex Minimax Problems
Marc Teboulle, Tel Aviv University
WB906 — Nonsmooth Optimization 1
-
Commutation principles for nonsmooth variational problems on Euclidean Jordan algebras
Juyoung Jeong, Changwon National University -
An efficient active-set method with applications to sparse approximations and risk minimization
Pougkakiotis Spyridon, University of Dundee -
Douglas-Rachford is the best projection method
Hongzhi Liao, The University of New South Wales -
A new qualification condition for Lipschitzian optimization problems
Isabella Käming, Technische Universität Dresden
Stream 1d: Semi-Definite Programming
WB18 — Semidefinite Programming Performance Estimation
-
Accelerating Gradient Descent
Benjamin Grimmer, Johns Hopkins University -
Performance estimation for SDP hierarchies for polynomial optimization on the hypercube
Etienne De Klerk, Tilburg University -
** CANCELLED ** The exact worst-case convergence rate of the alternating direction method of multipliers
Hadi Abbaszadehpeivasti, Tilburg University -
Acceleration by Stepsize Hedging
Jason Altschuler, University of Pennsylvania
WB222 — Algorithms and Applications of Semidefinite Programming
-
** CANCELLED ** Solving Exact and Noisy Rank-one Tensor Completion with Semidefinite Programming
Zhuorui Li, Georgia Institute of Technology -
Random Projections for Semidefinite Programming and Polynomial Optimization
Monse Guedes Ayala, The University of Edinburgh -
HALLaR: A New Solver for Solving Huge SDPs
Arnesh Sujanani, Georgia Institute of Technology -
Sum of squares submodularity
Georgina Hall, INSEAD
Stream 1e: Variational Analysis, Variational Inequalities and Complementarity
WB227 — Algorithms for optimization, monotone inclusions and variational inequalities 4
-
Single-loop stochastic variance reduced method for variational inequalities
Afrooz Afrooz Jalilzadeh, University of Arizona -
** CANCELLED ** Tikhonov regularized exterior penalty dynamics for constrained variational inequalities
Siqi Qu, University of Mannheim -
Synchronous and asynchronous gradient-response schemes for computing quasi-Nash equilibria under uncertainty
Zhuoyu Xiao, Pennsylvania State University -
Stochastic Halpern iteration in non-Euclidean spaces and applications to synchronous $Q$-learning
Juan Pablo Contreras, Pontificia Universidad Católica De Chile
WB329 — Conic optimization
-
Extensions of constant rank qualification constraint condition to nonlinear conic programming
Hector Ramirez, Universidad De Chile -
Learning quantum Hamiltonians at any temperature in polynomial time with Chebyshev and bit complexity
Ales Wodecki, Czech Technical University, Prague -
Time-varying semidefinite programming: path-following a Burer-Monteiro factorization
Antonio Bellon, Universität Augsburg -
Time-varying semidefinite programming: geometry of the trajectory of solutions
Jakub Marecek, CTU Prague
Stream 1f: Random Methods for Continuous Optimization
WB49 — Splitting and Randomized Methods 1
-
Improved L-BFGS Methods for Large-Scale Unconstrained Optimization
Mehiddin Al Baali, Sultan Qaboos University -
A Decentralized Primal-Dual Method with Quasi-Newton Tracking
Liping Wang, Nanjing University of Aeronautics And Astronautics -
** MOVED TO FRIDAY AM REMOTE SESSION ** Group SLOPE Penalized Low-Rank Tensor Regression
Ziyan Luo, Beijing Jiaotong University -
Revisit Iterative Complexity of Some Projection Methods for Monotone Linear Variational Inequalities
Deren Han, Beihang University
Stream 1h: Optimal Control, PDE Constrained Optimization, and Multi-level Methods
WB321 — Challenging PDE Constrained Applications
-
Low-rank tensor approximation for risk averse optimization
Akwum Onwunta, Lehigh University -
Optimal Control of the Generalized Riemann Problem for Hyperbolic Systems of Conservation Laws
Jannik Breitkopf, Technical University Darmstadt -
A Variational Calculus for Optimal Control of Networks of Scalar Conservation or Balance Laws
Marcel Maximilian Steinhardt, Technical University Darmstadt -
Parameter Identification in Boundary Value Problems for Fiber Spinning
Lukas Kannengießer, Trier University
Stream 2a: Mixed Integer Linear Programming
WB236 — Bilevel Optimization with Discrete Decisions (II)
-
Network Relaxations for Discrete Bilevel Optimization under Linear Interactions
Leonardo Lozano, University of Cincinnati -
Using Disjunctive Cuts in a Branch-and-Cut Method to Solve Convex Integer Nonlinear Bilevel Problems
Andreas Horländer, Trier University -
Interdiction of minimum spanning trees and other weighted matroids
Noah Weninger, University of Waterloo -
Combinatorial pricing problems: methods using embedded dynamic programming models
Margarida Carvalho, Université De Montréal
WB917 — Mixed Integer Linear Programming 3
-
A block decomposition algorithm for an extension of the vertex cover problem
Juan Francisco Correcher, Universitat De València -
Preliminary results on an extension of the vertex cover problem
Juanjo Peiró, Universitat De València -
Analyzing the Sensitivity of Integer Linear Programs via Optimization Oracles
Erik Jansen, Tu Darmstadt -
1,000,000 Point Steiner Tree Solved to Optimality
David Warme, Group W
Stream 2b: Mixed Integer Nonlinear Programming
WB7 — Algorithms for Global Mixed Integer Nonlinear Optimization
-
Solving MINLPs to Global optimality with the FICO Xpress Solver
Imre Polik, Fico Xpress -
RAPOSa: A free global solver for mixed integer polynomial optimization problems
Julio González Díaz, University of Santiago De Compostela -
Techniques and advances for solving MINLPs with Gurobi
Robert Luce, Gurobi -
Spatial branching for convex MIQO problems
Pietro Belotti, Politecnico Di Milano
Stream 2c: Combinatorial Optimization and Graph Theory
WB15 — Discrete Optimization
-
Good and Fast Row-Sparse ah-Symmetric Reflexive Generalized Inverses
Gabriel Ponte, University of Michigan / Federal University of Rio De Janeiro -
A column-generation based heuristic for integrating machine scheduling and personnel allocation
Daniela Lubke, University of Waterloo -
Semialgebraic characterization of triangulation
Yuan Zhou, University of Kentucky -
On disjunction convex hulls by lifting
Yushan Qu, University of Michigan
WB185 — Complexity and algorithmic aspects of structured families of graphs 3
-
H-Chromatic Symmetric Functions
Angele Foley, Wilfrid Laurier University -
Coloring graphs by forbidden induced subgraphs
Chính Hoàng, Wilfrid Laurier University -
Intersection of chordal graphs and some related partition problems
R Sritharan, University of Dayton -
Efficient certifying algorithms for k-colouring subfamilies of P5-free graphs
Ben Cameron, University of Prince Edward Island
Stream 2d: Machine Learning and Discrete Optimization
WB230 — Combinatorial Optimization Augmented Machine Learning and Decision Aware Learning
-
Learning to solve large-scale districting problems
Cheikh Ahmed, Ecole Polytechnique Montreal -
Surrogate policies with generalization guarantees for combinatorial optimization problems
Axel Parmentier, CERMICS, Ecole des Ponts -
Neur2BiLO: Neural Bilevel Optimization
Esther Julien, Tu Delft -
From Large to Small Datasets: Size Generalization for Clustering Algorithm Selection
Ellen Vitercik, Stanford
Stream 2e: Approximation and Online Algorithms
WB146 — Stochastic Combinatorial Optimization II
-
Fast Online Node Labeling for Very Large Graphs
Yifan Sun, Stony Brook University -
Semi-Bandit Learning for Monotone Stochastic Optimization
Rohan Ghuge, Georgia Tech -
Power of Adaptivity for Stochastic Submodular Cover
Viswanath Nagarajan, University of Michigan -
Recent Advances in Stochastic Function Evaluation: Score Classification and Voting
Kevin Schewior, University of Southern Denmark
Stream 2f: Computational Discrete and Integer Optimization
WB341 — Computational Mixed Integer Programming
-
Generalized Resolution Conflict Analysis in MIP Solvers
Gioni Mexi, Zuse Institute Berlin -
Recent additions to the collection of cutting planes in Gurobi
Pierre Bonami, Gurobi -
Leveraging Discounted Pseudocosts in MILP for Enhanced Branching Strategies
Krunal Kishor Patel, CERC, Polytechnique Montreal -
Variable Fixing for Integer Linear Programming via Objective Rotation
Lukas Schürmann, University of Bonn
Stream 3a: Continuous Stochastic Programming
WB232 — Decision-Focused Learning and Bilevel Models for Stochastic Optimization
-
Assessing solution quality in risk-averse stochastic programs
Ruben Van Beesten, Erasmus University Rotterdam -
An implementation of the Adaptive Partition Method to Stochastic Bilevel Problems
Francisco Jara Moroni, Universidad Diego Portales -
Decision-focused predictions via pessimistic bilevel optimization: a computational study
Víctor Bucarey, Universidad De O'higgins -
Application-Driven Optimal Pointwise Forecasts for Stochastic Optimization
Tito Homem De Mello, Universidad Adolfo Ibañez
Stream 3b: Discrete Stochastic Programming
WB178 — Recent Advances to Solve Discrete Stochastic Problems
-
Accelerating Benders decomposition for solving a sequence of sample average approximation problems
Harshit Kothari, University of Wisconsin Madison -
Scaled cuts for multistage stochastic mixed-integer programs
Ward Romeijnders, University of Groningen -
Single-Scenario Facet Preservation for Stochastic Mixed-Integer Programs
Aysenur Karagoz, Rice University -
Test sets to compute opportunity cost matrices
Janosch Ortmann, UQAM
Stream 3c: Robust and Distributionally Robust Optimization
WB125 — Robust Optimization and Machine Learning 4
-
First-order data-driven distributionally robust optimization
Shimrit Shtern, Technion Israel Institute of Technology -
** CANCELLED ** New algorithm for the difference of convex functions optimization problem
Aharon Ben Tal, Technion Israel Institute of Technology -
Towards Watermarking Tabular Datasets
Vamsi Potluru, J.P. Morgan AI Research -
Online MDP with Transition Prototypes: A Robust Adaptive Approach
Shuo Sun, University of California, Berkeley
WB939 — Robust and Distributionally Robust Optimization 2
-
Robust Optimization Under Controllable Uncertainty
Eva Ley, Tu Braunschweig -
Clustering-based scenario reduction for distributionally robust optimization with approximation guarantees
Kevin Martin Aigner, Friedrich Alexander University Erlangen Nürnberg -
** CANCELLED ** Distributionally Robust Optimization Approaches for Resilience and Low Carbon Enhancement of Distribution Power Systems
Tianxiao Wang, Nanjing University -
Streamlining Emergency Response: A K-Adaptable model and a Column-and-Constraint-Generation Algorithm
Fabricio Oliveira, Aalto University
Stream 3d: Multi-stage Stochastic Programming and Reinforcement learning
WB176 — Advances in Stochastic Programming
-
Optimal L-p Risk Minimization
Guanghui Lan, Georgia Institute of Technology -
Epi-Consistency of Multistage Stochastic Optimization Problems
Dominic Keehan, University of Auckland -
Three-stage Stochastic Programming is As Easy As Classical Stochastic Optimization
Yifan Hu, EPFL -
Risk averse and distributionally robust modeling of multistage stochastic programming
Alexander Shapiro, Georgia Institute of Technology
Stream 3e: Data-driven optimization
WB82 — Data-driven Optimization Under Uncertainty: Theory and Applications
-
Robust Design of Critical Supply Chains
Hao Hao, Carnegie Mellon University -
Integer Programming Approaches for Distributionally Robust Chance Constraints with Adjustable Risks
Yiling Zhang, University of Minnesota -
On the Trade-off Between Distributional Belief and Ambiguity: Conservatism, Bias, and Asymptotic Properties
Karmel Shehadeh, Lehigh University -
Residuals-Based Contextual Distributionally Robust Optimization with Decision-Dependent Uncertainty
Xian Yu, The Ohio State University
Stream 4b: Transportation and logistics
WB147 — Large-scale optimization in action: methods and applications
-
A Better Match for Everyone, Reinforcement Learning for Ridesharing
Sebastien Martin, Northwestern University, Kellogg School Of Management -
Branch-and-price for prescriptive contagion analytics
Alexandre Jacquillat, MIT Sloan School Of Management -
Heterogeneous Treatment Effects In Matching Marketplaces Under Interference: From Estimation to Decision
Arthur Delarue, Georgia Institute of Technology -
Modeling and Optimizing Large-Scale Inventory Routing in East Africa: A Data-Driven Optimization Approach
Simon Thomä, Rwth Aachen University
Stream 4a: Networks and Telecom
WB944 — Networks and Telecom 2
-
Online Convex Optimization for On-Board Routing in High-Throughput Satellites
Olivier Bélanger, Polytechnique Montréal -
Application placement simulations over HEAVEN platform
Antoine Bernard, Polytechnique Montréal -
Fiber-to-the-Home Passive Optical Access Network Design: A New Formulation and Valid Inequalities
Sachin Jayaswal, Indian Institute of Management Ahmedabad
Stream 4g: High performance implementation and quantum computing
WB267 — Parallel solvers
-
QuBowl: An exact solver for MaxCut and QUBO problems
Daniel Rehfeldt, Zuse Institute Berlin -
Progress on highly parallel ensemble solvers
Yuji Shinano, Zuse Institute Berlin -
Solving Large-Scale Quadratic Assignment Problems by a Parallelized Lagrangian-DNN-Based Branch-and-Bound
Koichi Fujii, Tokyo Institute of Technology -
Parallel General-Purpose Dynamic Programming Solvers for Combinatorial Optimization
Ryo Kuroiwa, University of Toronto
Stream 4d: Energy and Environment
WB958 — Energy and Environment 3
-
Robust Optimal Design of Renewable Energy Systems within an Energy Storage Process using Iron as Energy Carrier
Elisa Corbean, Technical University of Darmstadt -
A Robust Data-Driven Approach to Characterize Operational Flexibility Zones of Active Distribution Networks
Alejandro Angulo, Universidad Técnica Federico Santa María -
A Heuristic Adversarial Approach for the Two-Stage Robust AC OPF Problem
Jorge Weston, Friedrich Alexander Universtät Erlangen Nürnberg
Stream 5c: Special sessions
WB317 — In memory of Jean-Louis Goffin 2: Analytic Centre Cutting Plane Methods: The contributions of J-L Goffin's work
-
From the Relaxation Method to Chubanov’s Algorithm, from ACCPM to Tall LPs.
Tamás Terlaky, Lehigh University -
A personal view of primal-dual interior-point algorithms for large-scale optimization and some recent developments
Levent Tuncel, University of Waterloo -
Analytic Centres and Mixed Integer Programming
Samir Elhedhli, University of Waterloo -
Local center cutting plane methods framework
Mohamed El Fassi, Polytechnique Montréal