ISMP 2024

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

HSODF: A Homogeneous Framework for Second-Order 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
** CANCELLED ** Online Learning Guided Quasi-Newton Methods: Improved Global Non-asymptotic Guarantees
Ruichen Jiang, UT Austin
Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees
Nachuan Xiao, National University of Singapore

Sharpness and well-conditioning 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 primal-dual hybrid gradient for linear programming
Jinwen Yang, University of Chicago
Top-K Ranking with a Monotone Adversary
Cong Ma, University of Chicago

Practical session : Model and solve a non-linear optimization problem with Artelys Knitro
Carlyle Deligny, Artelys Canada Inc
The k-cut 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

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

Exploiting low-rank SDP methods for solving Max-Cut
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
** Permuted with Raymond's talk at 10:00 ** Combinatoric Derivations and Sidorenko's Conjecture
Daniel Brosch, University of Klagenfurt
** Permuted with Borsch's talk at 9:30 ** Sums of squares and Sidorenko's conjecture
Annie Raymond, University of Massachusetts, Amherst

The radius of statistical efficiency
Mateo Diaz, Johns Hopkins University
The Role of Subgradients in Second-Order Variational Analysis
Ebrahim Sarabi, Miami University
Polyhedral Newton-min algorithms for complementarity problems
Jean Pierre Dussault, Université De Sherbrooke
Levenberg-Marquardt globalization of the polyhedral Newton-min algorithm for complementarity problems
Baptiste Plaquevent Jourdain, INRIA Paris, Université De Sherbrooke

On projections onto Parametric Polyhedral Sets
Krzysztof Rutkowski, Cardinal Stefan Wyszyński University In Warsaw
Douglas-Rachford splitting algorithm with line search
Lingling Xu, School Of Mathematical Science, Nanjing Normal University
Primal-Dual Methods with Adjoint Mismatch - Existence of Stationary Points, Convergence and Error Bounds
Felix Schneppe, University of Bremen
Last-Iterate Convergence of Saddle-Point Optimizers via High-Resolution Differential Equations
Tatjana Chavdarova, Cispa And Saarland University

Tractable smart predict and optimize in the non-realizable case
Omar Bennouna, Massachusetts Institute of Technology
Robust Lane Covering Problem
İhsan Yanıkoğlu, Assoc. Prof.
Distributionally Robust Optimization with Multimodal Decision-Dependent Ambiguity Sets
Beste Basciftci, University of Iowa
Electric Bus Fleet Scheduling under Travel Time and Energy Consumption Uncertainty
Farzad Avishan, HEC Montréal

Equivalent reformulation of multistage robust optimization under time-varying exogenous uncertainty with an application to optimal bidding in energy markets
Mirai Tanaka, The Institute of Statistical Mathematics
General Polyhedral Approximation of Two-Stage Robust Linear Programming
Tim Niemann, Tu Braunschweig
Multi-purchase behavior: Modeling, estimation, and optimization
Deeksha Sinha, Meta
** CANCELLED ** A Robust Approach to Classification and Truth-Validation: Incorporating Human and Large Language Model Decision Making
Chaithanya Bandi, NUS Business School

Privacy-Preserving Decentralized Local Electricity Markets
Lesia Mitridati, Technical University of Denmark
Data Valuation in Data-driven Stochastic Optimization
Juan M. Morales, University of Malaga
Hierarchical Feedback-Based Optimization of Distributed Energy Resources in Distribution Grids
John W. Simpson Porco, University of Toronto
Online Interior-point Methods for Time-Varying Equality-constrained Optimization
Antoine Lesage Landry, Polytechnique Montreal, GERAD

Decision-Focused 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 Large-Scale Electric Bus Fleet Transition Problem
Robin Legault, Massachusetts Institute of Technology