ISMP 2024

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

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

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
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

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

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

The Maximum Singularity Degree for Linear and Semidefinite Programming
Hao Hu, Clemson University
Ramana's dual redux
Gabor Pataki, UNC Chapel Hill
A Peaceman-Rachford Splitting Method for the Protein Side-Chain Positioning Problem and other Hard Problems
Henry Wolkowicz, University of Waterloo

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

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

Conformal Inverse Optimization
Bo Lin, University of Toronto
Learning Decision-Focused Uncertainty Sets in Robust Optimization
Irina Wang, Princeton University
A Clustering-based uncertainty set for Robust Optimization
Alireza Yazdani, Eindhoven University of Technology
Neur2RO: Neural Two-Stage Robust Optimization
Justin Dumochelle, University of Toronto

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
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

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

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

Competing on Emissions Charges
Gianmarco Andreana, University of Bergamo
Hub Transportation Problem with Chance Constrained Due Dates
Öykü Naz Attila, Polytechnique Montreal
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