PROGRAM
Days: Friday, March 22nd Saturday, March 23rd Sunday, March 24th
Friday, March 22nd
View this program: with abstractssession overviewtalk overview
08:30-10:00 Session FriA 1
08:30 | Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization (abstract) |
08:52 | Computing Approximate $\ell_p$ Sensitivities (abstract) |
09:14 | A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport (abstract) |
09:36 | A simple uniformly optimal method without line search for convex optimization (abstract) |
08:30-10:00 Session FriA 2
08:30 | Quantum Algorithms for Scientific Computation and Optimization Problems (abstract) |
08:52 | Quantum communication complexity of linear regression (abstract) |
09:14 | Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling (abstract) |
09:36 | Quantum Lower Bounds for Finding Stationary Points of Nonconvex Functions (abstract) |
08:30-10:00 Session FriA 3
08:30 | Determining Sharp Proximity Bounds For Low Row Rank and $\Delta$-Modularity (abstract) |
08:52 | Tensor completion via integer optimization (abstract) |
09:14 | Parallelized Conflict Graph Cut Generation (abstract) |
09:36 | Strategy Investments in Matrix Games (abstract) |
08:30-10:00 Session FriA 4
08:30 | Adaptive Surrogate Modeling for Trajectory Optimization with Model Inexactness (abstract) |
08:52 | Optimization under Rare Chance Constraints (abstract) |
09:14 | Fast iterative solvers for initial value control problems with application to diffeomorphic image registration (abstract) |
09:36 | Neural Network Approaches for Parameterized Optimal Control (abstract) |
08:30-10:00 Session FriA 5
08:30 | A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming (abstract) |
08:52 | Sublevel-Set Geometry and the Performance of restarted-PDHG for Linear and Conic Optimization (abstract) |
09:14 | Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient (abstract) |
09:36 | Improving the Geometry of Linear and Conic Optimization Problems for restarted-PDHG (abstract) |
08:30-10:00 Session FriA 6
08:30 | Stochastic derivative-free optimization algorithms using random subspace strategies (abstract) |
08:52 | Branch-and-Model: A Derivative-free Global Optimization Algorithm (abstract) |
09:14 | First-order Trust-region Methods with Adaptive Sampling (abstract) |
09:36 | Enabling Scale-up through Multi-fidelity Adaptive Computing (abstract) |
08:30-10:00 Session FriA 7
08:30 | Wasserstein Regularization for 0-1 Loss (abstract) |
08:52 | A tractable smart predict-then-optimize algorithm beyond the realizable case (abstract) |
09:14 | PAC-Bayesian Spectrally-Normalized Bounds for Adversarially Robust Generalization (abstract) |
09:36 | Regularization for Adversarial Robust Learning (abstract) |
08:30-10:00 Session FriA 8
08:30 | Coordinate Partitioning for Difficult Euclidean Max-Sum Diversity Problems (abstract) |
08:52 | Boosted Difference of Convex Algorithms for Clustering with Constraints (abstract) |
09:14 | Efficient relax-and-cut separation in a branch-and-cut solver (abstract) |
09:36 | Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe (abstract) |
08:30-10:00 Session FriA 9
08:30 | Joint Expansion Planning of Power and Water Distribution Networks (abstract) |
08:52 | Designing Resilient Relay Logistics Networks Using k Shortest Paths (abstract) |
09:14 | Data Storage and Sharing Scheme Based on Double Blockchain and Proxy Re-Encryption (abstract) |
09:36 | Online Resource Allocation with Predictions (abstract) |
08:30-10:00 Session FriA10
08:30 | Spectral Bundle Methods For Primal And Dual Semidefinite Programs (abstract) |
08:52 | A globally convergent difference-of-convex algorithmic framework and application to log-determinant optimization problems (abstract) |
09:14 | Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition (abstract) |
09:36 | Uncertainty Quantification of Set-Membership Estimation in Control and Perception: Revisiting the Minimum Enclosing Ellipsoid (abstract) |
08:30-10:00 Session FriA11
08:30 | A Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming Based on a Hybrid Convex-Nonconvex Approach (abstract) |
08:52 | A Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming Based on a Hybrid Convex-Nonconvex Approach: Part II (abstract) |
09:14 | An Adaptive Block Proximal ADMM for Weakly Convex, Linearly-Constrained Composite Functions. (abstract) |
09:36 | Problem-dependent convergence analysis for randomized linear gradient compression (abstract) |
08:30-10:00 Session FriA12
08:30 | Optimal Minimax Optimization and Variational Inequalities with Separable Structure (abstract) |
08:52 | Stochastic Controlled Averaging for Federated Learning with Communication Compression (abstract) |
09:14 | On the Adversarial Robustness of Benjamini Hochberg (abstract) |
09:36 | Mirror descent for multi-armed bandits (abstract) |
13:00-14:30 Session FriB 1
13:00 | Partially observable multi-agent RL with (quasi-)efficiency: The blessing of information sharing (abstract) |
13:22 | Last-Iterate Convergence for Learning in Games (abstract) |
13:44 | Efficiently Computing Nash Equilibria in Adversarial Team Markov Games (abstract) |
14:06 | High probability and risk-averse guarantees for stochastic saddle point problems (abstract) |
13:00-14:30 Session FriB 2
13:00 | An Exponential Quantum Advantage for Approximating Directed Max Cut in Graph Streams (abstract) |
13:22 | Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms (abstract) |
13:44 | Quantum algorithms and software for nonconvex optimization (abstract) |
14:06 | On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks (abstract) |
13:00-14:30 Session FriB 3
13:00 | A characterization of simultaneous optimization, majorization, and (bi)submodular polyhedra (abstract) |
13:22 | On the structure of the inverse-feasible region of a multiobjective integer program (abstract) |
13:44 | Pareto Leap: An Algorithm for Biobjective Mixed-Integer Programming (abstract) |
14:06 | Relaxation and Duality for Multiobjective Integer Programming (abstract) |
13:00-14:30 Session FriB 4
13:00 | Dynamic Parameter Estimation in Deterministic Dynamical Systems (abstract) |
13:22 | Optimization on Measure Spaces with Regular Divergences and Mixed Boundary Conditions (abstract) |
13:44 | A Discontinuous Galerkin Method for Optimal Control Problem of the Obstacle Problem (abstract) |
14:06 | Risk-averse optimization using randomized quasi-Monte Carlo methods (abstract) |
13:00-14:30 Session FriB 5
13:00 | Computational and duality properties of Hoffman constants (abstract) |
13:22 | cuPDLP.jl: A GPU Implementation of Restarted Primal-Dual Hybrid Gradient for Linear Programming in Julia (abstract) |
13:44 | Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs (abstract) |
14:06 | A feasible method for general convex low-rank SDP problems (abstract) |
13:00-14:30 Session FriB 6
13:00 | Scalable Climate-Aware Power Grid Capacity Expansion using MPI-SPPY (abstract) |
13:22 | A filter trust-region continuation method for contact optimization and complementarity problems (abstract) |
13:44 | Diagnostic Tools for Nonlinear Optimization (abstract) |
14:06 | Mathematical Modeling in Gravity: Lessons Learned (abstract) |
13:00-14:30 Session FriB 7
13:00 | Impact of Uncertainty on Fairness (abstract) |
13:22 | Estimate-Then-Optimize versus Integrated-Estimation-Optimization versus Sample Average Approximation: A Stochastic Dominance Perspective (abstract) |
13:44 | The Terminator: An Integration of Inner and Outer Approximations for Solving Regular and Distributionally Robust Chance Constrained Programs via Variable Fixing (abstract) |
14:06 | Learning Decision-Focused Uncertainty Sets in Robust Optimization (abstract) |
13:00-14:30 Session FriB 8
13:00 | AI Hilbert: A New Paradigm for Scientific Discovery by Unifying Data and Background Knowledge (abstract) |
13:22 | Gain Confidence, Reduce Disappointment: A New Approach to Cross-Validation for Sparse Regression (abstract) |
13:44 | Can we globally optimize cross-validation loss? Quasiconvexity in ridge regression (abstract) |
14:06 | Stability Analysis of Discrete-Time Linear Complementarity Systems (abstract) |
13:00-14:30 Session FriB 9
13:00 | Derivation and Generation of Path-Based Valid Inequalities for Transmission Expansion Planning with New Bus Integration (abstract) |
13:22 | Intertemporal Uncertainty Management in Gas-Electric Energy Systems using Stochastic Finite Volumes (abstract) |
13:44 | A Compact Formulation for Dense Fixed-Charge Network Flow Problems (abstract) |
14:06 | Convex Hull Pricing in Electricity Markets: Evidence from a Large US Market (abstract) |
13:00-14:30 Session FriB10
13:00 | Bayesian Strategies for Numerical Solutions in Nonlinear Fractional Order Systems: A Focus on Cutaneous Leishmaniasis (abstract) |
13:22 | LINE-SEARCH BASED OPTIMIZATION USING FUNCTION APPROXIMATIONS WITH TUNABLE ACCURACY (abstract) |
13:44 | Optimization in hybrid controlled systems with piecewise-smooth systems' dynamics. (abstract) |
14:06 | Optimality analysis and duality conditions for a class of conic semi-infinite program having vanishing constraints (abstract) |
13:00-14:30 Session FriB11
13:00 | Interior point method for tensor optimal transport, spectral radius of nonnegative tensors and hypergraphs (abstract) |
13:22 | Solving Tall Dense SDPs in the Current Matrix Multiplication Time (abstract) |
13:44 | A Higher-Order Interior Point Method for Semidefinite Optimization Problems Failing Strict Complementarity Condition (abstract) |
15:00-16:30 Session FriC 1
15:00 | A Stochastic GDA Method with Backtracking for Solving Nonconvex (Strongly) Concave Minimax Problems (abstract) |
15:22 | Towards Provable Gradient Descent Ascent Dynamics in Hidden Structure (abstract) |
15:44 | f-FERM: A Scalable Framework for Robust Fair Empirical Risk Minimization (abstract) |
16:06 | Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization (abstract) |
15:00-16:30 Session FriC 2
15:00 | Co-Design of Complex Systems: From Autonomy to Future Mobility Systems (abstract) |
15:22 | Follower Agnostic Methods for Stackelberg Games (abstract) |
15:44 | Modeling Processes of Neighborhood Change (abstract) |
16:06 | When Simple is (Near)-Optimal in Security Games for Urban Transportation (abstract) |
15:00-16:30 Session FriC 3
15:00 | Sensitivity analysis for mixed binary quadratic programming (abstract) |
15:22 | Fair Minimum Representation Clustering (abstract) |
15:44 | DeLuxing: Deep Lagrangian Underestimate Fixing for Column-Generation-Based Exact Methods (abstract) |
16:06 | M-Decomposable Sets in Integer Programming (abstract) |
15:00-16:30 Session FriC 4
15:00 | Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems (abstract) |
15:22 | An Inexact Conditional Gradient Method for Constrained Bilevel Optimization (abstract) |
15:44 | In-Context Convergence of Transformers (abstract) |
16:06 | Min-Max Problems with Coupled Constraints: Theory and Algorithms (abstract) |
15:00-16:30 Session FriC 5
15:00 | Linear programming using diagonal linear networks (abstract) |
15:22 | New Developments of ADMM-based Interior Point Methods for Linear Programming and Conic Programming (abstract) |
15:44 | Recent advances in the COPT conic optimizer (abstract) |
16:06 | EXPRESS: Automatic Convexity Detection and Transformation to Conic Forms for Nonlinear Optimization (abstract) |
15:00-16:30 Session FriC 6
15:00 | Accelerated Nonlinear Programming on GPUs: Implementing Solver and Automatic Differentiation (abstract) |
15:22 | Optimizing AC Power Flow by Exploiting the Power Flow Manifold (abstract) |
15:44 | Scalable, high performance linear solvers for nonlinear constrained optimization problems (abstract) |
16:06 | Frequency Recovery in Power Grids using High-Performance Computing (abstract) |
15:00-16:30 Session FriC 7
15:00 | Online Rack Placement in Large-scale Data Centers (abstract) |
15:22 | Minimum Cost Adaptive Submodular Cover (abstract) |
15:44 | A Semidefinite Hierarchy for Expected Independence Numbers of Random Graphs (abstract) |
16:06 | Adaptive Bin Packing with Overflow (abstract) |
15:00-16:30 Session FriC 8
15:00 | Learning to Accelerate the Global Optimization of Quadratically-Constrained Quadratic Programs (abstract) |
15:22 | A Generalizable End-to-End Learning Approach for Global Optimization of Quadratically-Constrained Quadratic Programs (abstract) |
15:44 | Solution of disjoint bilinear programs using simplicial branch-and-bound (abstract) |
16:06 | Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs (abstract) |
15:00-16:30 Session FriC 9
15:00 | Backhaul Profit Maximization with Multiple Vehicles (abstract) |
15:22 | Pricing and Routing Strategy to Maximize Profit in Congested Roads Considering Interactions with Travelers (abstract) |
15:44 | Integer programming formulations for partitioning a graph into low-diameter clusters (abstract) |
16:06 | The edge-based contiguous p-median problem with connections to territorial districting (abstract) |
15:00-16:30 Session FriC10
15:00 | A study on two-metric projection methods (abstract) |
15:22 | First-order Methods for Bilevel Optimization (abstract) |
15:44 | [REFEREED PAPER TRACK ONLY] Convergence Guarantees of a Distributed Network Equivalence Algorithm for Distribution-OPF (abstract) |
16:06 | Toward a grand unified theory of accelerations in optimization and machine learning (abstract) |
15:00-16:30 Session FriC11
15:00 | Learning and Predictions in Power System Frequency Control (abstract) |
15:22 | Unit Commitment without Commitment: A Dynamic Framework for Managing an Integrated Energy System Under Uncertainty (abstract) |
15:44 | Systemic Risk Measures Based On Value-at-Risk (abstract) |
16:06 | Sectoral portfolio optimization by judicious selection of financial ratios via PCA (abstract) |
15:00-16:30 Session FriC12
15:00 | A Multiparametric Programming Approach to Accelerate Neural Network based Model Predictive Control (abstract) |
15:22 | Improved Airline Network Topologies for Building Resilient & Robust Aviation Infrastructures (abstract) |
15:44 | Edge-concave Underestimators and Relaxations for Deterministic Global Optimization (abstract) |
16:06 | A Hierarchy of Nonconvex Continuous Reformulations for Discrete Optimization (abstract) |
16:45-18:15 Session FriD 1
16:45 | Efficient Pre-training on Massive Datasets: A Data perspective (abstract) |
17:07 | Adaptive Experimentation at Scale (abstract) |
17:29 | In-context learning of linear functions with gradient descent (an invited talk) (abstract) |
17:51 | How well do learning and dimension reduction methods for nonlinear dynamics generalize? (abstract) |
16:45-18:15 Session FriD 2
16:45 | Branch-and-price for prescriptive contagion analytics (abstract) |
17:07 | Electric Vehicle Routing: Subpath-Based Decomposition (abstract) |
17:29 | Pricing Shared Rides (abstract) |
17:51 | Submodular Dispatching with Multiple Vehicles (abstract) |
16:45-18:15 Session FriD 3
16:45 | Risk-Aware Security-Constrained Unit Commitment (abstract) |
17:07 | Performance Risk Scoring of Risk-free Renewable Generation Bids (abstract) |
17:29 | ABSCORES, Managing Risk and Uncertainty in Electricity Systems Using Banking Scoring and Rating Methodologies (abstract) |
17:51 | Optimizing design and dispatch of a renewable energy system with combined heat and power (abstract) |
16:45-18:15 Session FriD 4
16:45 | Local convergence of a sequential quadratic programming method for a class of nonsmooth nonconvex objectives (abstract) |
17:07 | A new working set method for nonlinear optimization (abstract) |
17:29 | Projection-Free Methods for Solving Nonconvex-Concave Saddle Point Problems (abstract) |
17:51 | Optimization with Superquantile Constraints: A Fast Computational Approach (abstract) |
16:45-18:15 Session FriD 5
16:45 | A Quantum-Classical Performance Separation in Nonconvex Optimization (abstract) |
17:07 | Analysis of Quantum Linear System Algorithms for Linear Systems in Tensor Format (abstract) |
17:29 | Divide and conquer approach for distributed quantum computing (abstract) |
17:51 | Rigorously Approximating the Local Hamiltonian Problem (abstract) |
16:45-18:15 Session FriD 6
16:45 | Towards Non-stationary Bayesian Nonparametrics (abstract) |
17:07 | Stochastic Average Model Methods (abstract) |
17:29 | Integration of Machine Learning and Genetic Algorithm as a Generative Model (abstract) |
17:51 | Cost-Optimization of Process-Scale Desalination Systems Incorporating Surrogate-based Water Chemistry Models (abstract) |
16:45-18:15 Session FriD 7
16:45 | Adversarially Robust Optimal Control with Causal Transport Distance (abstract) |
17:07 | Multi-stage stochastic programming for integrated hurricane relief logistics and evacuation planning (abstract) |
17:29 | Data-driven Policies for Multistage Stochastic Programming (abstract) |
17:51 | Adaptive Multistage Stochastic Programming (abstract) |
16:45-18:15 Session FriD 8
16:45 | Hicksian Unit-Demand Pricing (abstract) |
17:07 | Min-max-min Optimization with Smooth and Strongly Convex Objectives (abstract) |
17:29 | Convex Inverse Mixed-Integer Linear Programming (abstract) |
17:51 | Learning Discrete-Time Markov Chains from Aggregate Data (abstract) |
16:45-18:15 Session FriD 9
16:45 | Recent advances in computing Nash equilibria in Markov Games (abstract) |
17:07 | Two-Timescale Q-Learning with Function Approximation in Zero-Sum Markov Games (abstract) |
17:29 | Decentralized and Networked Policy Gradient for Solving Markov Potential Games (abstract) |
17:51 | Optimistic Policy Iteration In Linearly-Solvable Multi-Agent Games (abstract) |
16:45-18:15 Session FriD10
16:45 | Minimal representations of generalized power cones (abstract) |
17:07 | Integer Points in Convex Cones: The Case of PSD and SOC (abstract) |
16:45-18:15 Session FriD11
16:45 | Mixture Model for Contextual Route Choice in Multimodal Transportation Systems (abstract) |
17:07 | Profits or Loss: Installing Electric Vehicle Chargers on Public Parking Lots (abstract) |
17:29 | An infeasible interior-point arc-search algorithm for spacecraft trajectory optimization (abstract) |
17:51 | Optimization of Bioenergy supply chain for agricultural waste by Considering Environmental Aspects in Ireland (abstract) |
Saturday, March 23rd
View this program: with abstractssession overviewtalk overview
08:30-10:00 Session SatA 1
08:30 | Gradient Descent Provably Solves Nonlinear Tomographic Reconstruction (abstract) |
08:52 | PathProx: A Proximal Gradient Algorithm for Weight Decay Regularized Deep Neural Networks (abstract) |
09:14 | A linearly convergent Gauss-Newton subgradient method for ill-conditioned problems (abstract) |
09:36 | A superlinearly convergent subgradient method for nonsmooth optimization (abstract) |
08:30-10:00 Session SatA 2
08:30 | Using non-convex optimization in quantum process tomography: Factored gradient descent is tough to beat (abstract) |
08:52 | Iterative algorithms for finding phase factors in Quantum signal processing (abstract) |
09:14 | Local minima in quantum systems (abstract) |
09:36 | Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models (abstract) |
08:30-10:00 Session SatA 3
08:30 | Maximum Load Assortment Optimization: Approximation Algorithms and Adaptivity Gaps (abstract) |
08:52 | Stochastic Scheduling: Strategies for Abandonment Management (abstract) |
09:14 | Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals (abstract) |
09:36 | Adaptivity Gaps in Two-sided Assortment Optimization (abstract) |
08:30-10:00 Session SatA 4
08:30 | Stochastic-Gradient-based Interior-Point Algorithms (abstract) |
08:52 | Almost-sure convergence of iterates and multipliers in stochastic sequential quadratic optimization (abstract) |
09:14 | Retrospective Approximation for Stochastic Constrained Problems Using Sequential Quadratic Programming (abstract) |
09:36 | Sequential Quadratic Programming for Noisy Equality Constrained Optimization with Rank-Deficient Jacobians (abstract) |
08:30-10:00 Session SatA 5
08:30 | A Review of Quantum Interior Point Methods - pros and cons (abstract) |
08:52 | Discrete Optimization: A Quantum Revolution? (abstract) |
09:14 | Quantum algorithms for linear differential equations beyond Hamiltonian simulation (abstract) |
08:30-10:00 Session SatA 6
08:30 | Recent Developments in the Cardinal Optimizer (abstract) |
08:52 | Second-Derivative SQP Methods for Nonconvex Nonlinear Optimization (abstract) |
09:14 | Algorithm NCL for constrained optimization: Overcoming LICQ (abstract) |
09:36 | An LDLT Quasi-Newton Trust-Region Method (abstract) |
08:30-10:00 Session SatA 7
08:30 | A Robust Approach to Locating Vaccination Centers for a Pandemic: A Problem Driven by Herd Immunity and Decision-Dependent Utility, with a Solution Framework (abstract) |
08:52 | A Successive Refinement Algorithm for Stochastic Programs with Decision-Dependent Distribution Functions (abstract) |
09:14 | Distributionally Robust Optimization with Multimodal Decision-Dependent Ambiguity Sets (abstract) |
09:36 | Residual-Based Distributionally Robust Optimization with Decision-Dependent Uncertainty (abstract) |
08:30-10:00 Session SatA 8
08:30 | A Bilevel Optimization Approach for a Class of Combinatorial Problems with Disruptions and Probing (abstract) |
08:52 | A branch-and-bound framework to solve a general class of three-stage interdiction games (abstract) |
09:14 | A Single-Level Reformulation of Integer Bilevel Programs using Decision Diagrams (abstract) |
09:36 | Value Function Projections for Discrete Bilevel Optimization (abstract) |
08:30-10:00 Session SatA 9
08:30 | Explicit solutions of the SI and Bass models on random networks (abstract) |
08:52 | Distributionally Ambiguous Multistage Stochastic Integer and Disjunctive Programs: Applications to Sequential Two-player Network Interdiction Games (abstract) |
09:14 | Fundamentals of Sparse Exact Linear Algebra (abstract) |
09:36 | The minimum feedback arc set problem over bidirectional graphs with an application to faculty hiring networks (abstract) |
08:30-10:00 Session SatA10
08:30 | Machine learning enhanced meta-heuristic optimization algorithms for autonomous experimentation (abstract) |
08:52 | Hexaly, a new kind of global optimization solver (abstract) |
09:14 | Data-driven Parameter Estimation for Large-Scale Nonlinear Dynamical Systems (abstract) |
09:36 | Efficient Hybrid Simulation Optimization Via Graph Neural Network Metamodeling (abstract) |
08:30-10:00 Session SatA11
08:30 | A Fokker-Planck optimal control framework in esophageal cancer (abstract) |
08:52 | A differential game framework for regulating aberrant signaling pathways in esophageal cancer (abstract) |
09:14 | Classifying with Uncertain DEA (abstract) |
09:36 | Blind Source Separation with Spatiotemporal Beamforming (abstract) |
13:15-14:45 Session SatB 1
13:15 | Stochastic Gradient Succeeds for Bandits (abstract) |
13:37 | On the Foundation of Distributionally Robust Reinforcement Learning (abstract) |
13:59 | Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Algorithm Design and Convergence Analysis (abstract) |
14:21 | HyperAgent: A Simple, Efficient and Scalable Reinforcement Learning Framework in Complex Environment (abstract) |
13:15-14:45 Session SatB 2
13:15 | Data-Driven Structured Reinforcement Learning: Foundations and Practice (abstract) |
13:37 | Hindsight Learning for MDPs with Exogenous Inputs (abstract) |
13:59 | Scalable Decision-Focused Learning in Restless Multi-Armed Bandits with Application to Maternal and Child Health (abstract) |
14:21 | Handling Action Space Constraints in Deep Reinforcement Learning (abstract) |
13:15-14:45 Session SatB 3
13:15 | An interesting generalization of the Koopman-Beckmans quadratic assignment problem (abstract) |
13:37 | Quadratic Combinatorial Optimization: A Polyhedral Characterization of Linearizable Instances (abstract) |
13:59 | Simple Randomized Rounding for Max-Min Eigenvalue Augmentation (abstract) |
14:21 | Tightening Linear Reformulations of 0-1 Cubic Knapsack Problems with Variable Reordering (abstract) |
13:15-14:45 Session SatB 4
13:15 | A Theory of Non-Linear Feature Learning with One Gradient Step in Two-Layer Neural Networks (abstract) |
13:37 | Towards a First-Order Algorithmic Framework for Wasserstein Distributionally Robust Optimization (abstract) |
13:59 | How do neural nets learn features of "simple" functions (abstract) |
14:21 | Can Learning Be Explained By Local Optimality In Low-rank Matrix Recovery? (abstract) |
13:15-14:45 Session SatB 5
13:15 | Facial Reduction for Semidefinite Relaxations of Combinatorial Optimization Problems (abstract) |
13:37 | O-minimal structures and central paths in nonlinear optimization (abstract) |
13:59 | A Peaceman-Rachford Splitting Method for the Protein Side-Chain Positioning Problem (abstract) |
13:15-14:45 Session SatB 6
13:15 | Performance Benchmarks of Quantum Annealing Hardware (abstract) |
13:37 | Federated Hierarchical Tensor Networks: a Collaborative Quantum AI-Driven Framework for Healthcare (abstract) |
13:59 | Optimization Applications as Quantum Performance Benchmarks (abstract) |
14:21 | Benchmarking the Operation of Quantum Heuristics and Ising Machines: Scoring Parameter Setting Strategies on Optimization Applications (abstract) |
13:15-14:45 Session SatB 7
13:15 | MSPLib and MSPFormat: A Library Of Problems and a New Standardized Data Format For Benchmarking Stochastic Dual Dynamic Programming (abstract) |
13:37 | Self-Adapting Network Relaxations for Weakly Coupled Markov Decision Processes (abstract) |
13:59 | A Data-Driven Multistage Stochastic-Robust Optimization Approach with Temporally Correlated Uncertainty (abstract) |
14:21 | Nonlinear Decision Rules Made Scalable by Nonparametric Liftings (abstract) |
13:15-14:45 Session SatB 8
13:15 | Exact Algorithm for Maximum Feasible Subsystem Problems with Uncertain Input Data (abstract) |
13:37 | Chance-Constrained Fractional Programming under Ambiguity -- Distributionally Robust Maximization of Ratio Exceedance Probability (abstract) |
13:59 | Proximal OA method for solving nonconvex MIQCQP (abstract) |
14:21 | Risk-Adaptive Local Decision Rules (abstract) |
13:15-14:45 Session SatB 9
13:15 | Applications of 0-1 Neural Networks in Prescription and Prediction (abstract) |
13:37 | Adaptive Optimization and Safe Reinforcement for Heparin Doseing (abstract) |
13:59 | Improving Patient Access via Primary Care Optimization (abstract) |
14:21 | Quantify Childbirth Care Inequity for Socioeconomically Disadvantaged Groups (abstract) |
13:15-14:45 Session SatB10
13:15 | Surface Mount Technology (SMT) Production Line Scheduling by Computer Simulation and Genetic Algorithm (abstract) |
13:37 | A Novel Population Based Optimization Approach: GAGAN Algorithm for Traveling Salesman Problem (abstract) |
13:59 | Worm Optimization Algorithm to Solve for the Transportation Problem of Cross-Docking Network (abstract) |
13:15-14:45 Session SatB11
13:15 | Tight Bounds for The Price of Fairness (abstract) |
13:37 | Achieving Group Fairness through Social Welfare Optimization (abstract) |
13:59 | Districting with Overlapping Service Regions (abstract) |
14:21 | Dynamic Matching with Post-allocation Service and its Application to Refugee Resettlement (abstract) |
16:30-18:00 Session SatC 1
16:30 | No-Regret Online Reinforcement Learning with Adversarial Losses and Transitions (abstract) |
16:52 | Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements (abstract) |
17:14 | Policy Mirror Descent Inherently Explores the Action Space (abstract) |
17:36 | Constrained Policy Optimization in Reinforcement Learning: A Tale of Regularization and Optimism (abstract) |
16:30-18:00 Session SatC 2
16:30 | Neuromancer: Differentiable Programming Library for Data-driven Modeling and Control (abstract) |
16:52 | Exploiting Observed Network Behavior for Accelerated Optimal Power Flow (abstract) |
17:14 | Adaptive Prescriptions for Optimal Power Flow under Uncertainty (abstract) |
17:36 | On the coupling between the scheduling of electrified fleets of buses travel and charging and grid pricing. (abstract) |
16:30-18:00 Session SatC 3
16:30 | Non-Monotonicity of Branching Rules with respect to Linear Relaxations (abstract) |
16:52 | Compressing Branch-and-Bound Trees (abstract) |
17:14 | Branch-and-Bound with Predictions for Variable Selection (abstract) |
17:36 | Branch-and-bound for D-Optimality with fast local search and variable-bound tightening (abstract) |
16:30-18:00 Session SatC 4
16:30 | Lower Complexity Bounds of First-order Methods for Affinely Constrained Composite Non-convex Problems (abstract) |
16:52 | Last-iterate convergence for convex function-constrained optimization (abstract) |
17:14 | Computing a directional stationary solution of DC programs via ADMM (abstract) |
17:36 | Optimal Regularization for a Data Source (abstract) |
16:30-18:00 Session SatC 5
16:30 | Any-dimensional convex sets (abstract) |
16:52 | Iterative Refinement for Semidefinite Optimization (abstract) |
17:14 | Computing implicit equalities of a linear inequality system (abstract) |
16:30-18:00 Session SatC 6
16:30 | Model Deployment with GAMS Engine (abstract) |
16:52 | The Best of Both Worlds - Integrating Python and GAMS (abstract) |
17:14 | AMPLS Solver Libraries (abstract) |
17:36 | Automatic Reformulations in AMPL’s New MP Solver Interface Library (abstract) |
16:30-18:00 Session SatC 7
16:30 | Adaptive Partitioning for Chance-Constrained Problems with Finite Support (abstract) |
16:52 | Integer Programming Approaches for Distributionally Robust Chance Constraints with Adjustable Risks (abstract) |
17:14 | Chance-Constrained Set k-Covering Problem (abstract) |
17:36 | Mixed-Integer Programming Formulations for Chance-Constrained Optimization with Mixture Models (abstract) |
16:30-18:00 Session SatC 8
16:30 | Local Search for Constrained Determinant Maximization (abstract) |
16:52 | Non-convex geodesic optimization for the Paulsen problem in Frame Theory (abstract) |
17:14 | Hidden convexity, optimization, and algorithms on rotation matrices (abstract) |
17:36 | Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements (abstract) |
16:30-18:00 Session SatC 9
16:30 | SLoRA: Federated Parameter Efficient Fine-Tuning of Language Models (abstract) |
16:52 | Sparse Random Networks for Communication-Efficient Federated Learning (abstract) |
17:14 | Adaptive Federated Learning with Auto-Tuned Clients (abstract) |
17:36 | CyberTransfer: A Transfer Learning Approach for Enhancing Graph Neural Networks for Intrusion Detection (abstract) |
16:30-18:00 Session SatC10
16:30 | Exploring Nonlinear Distance Metrics for Lipschitz Constant Estimation in Lower Bound Construction for Global Optimization (abstract) |
16:52 | A New Fast Proximal Point Algorithm for Monotone Inclusions (abstract) |
17:14 | A new path tracking algorithm for solving the CDT subproblem (abstract) |
17:36 | Deep Learning with Nontrivial Constraints (abstract) |
Sunday, March 24th
View this program: with abstractssession overviewtalk overview
08:30-10:00 Session SunA 1
08:30 | Private Online Prediction from Experts: Separations and Faster Rates (abstract) |
08:52 | Advancements in Differentially Private Stochastic Convex Optimization: Towards Near-Linear Gradient Query Complexity (abstract) |
09:14 | Adversarial Robustness in the Streaming Model (abstract) |
09:36 | Nearly Optimal Algorithms for Privately Learning Thresholds and Approximating Median (abstract) |
08:30-10:00 Session SunA 2
08:30 | First-order methods for quantum entanglement detection (abstract) |
08:52 | Accelerating Continuous Variable Coherent Ising Machines via Momentum (abstract) |
09:14 | Constrained local Hamiltonians: quantum generalizations of Vertex Cover (abstract) |
09:36 | A Quantum Inspired Bi-level Optimization Algorithm for the First Responder Network Design Problem (abstract) |
08:30-10:00 Session SunA 3
08:30 | Dealing with disjunctive constraints in convex mixed-integer nonlinear programming: Efficient formulations and strong cuts (abstract) |
08:52 | Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (abstract) |
09:14 | Building Formulations for Combinatorial Disjunctive Constraints via Biclique Covers (abstract) |
09:36 | Aggregated Limited-Memory Rank-1 Cuts (abstract) |
08:30-10:00 Session SunA 4
08:30 | Stochastic FISTA with fully adapative step sizes. (abstract) |
08:52 | Stochastic Adaptive Regularization Method with Cubics: A High Probability Complexity Bound (abstract) |
09:14 | Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm (abstract) |
09:36 | Efficient Gradient Tracking Algorithmic Framework for Decentralized Optimization (abstract) |
08:30-10:00 Session SunA 5
08:30 | On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs (abstract) |
08:52 | Linear convergence of proximal point methods under Polyak-Łojasiewicz and quadratic growth conditions (abstract) |
09:14 | An Outer Approximation Method for Solving Mixed-Integer Convex Quadratic Programs with Indicators (abstract) |
09:36 | On Integer Programs with Irrational Data (abstract) |
08:30-10:00 Session SunA 6
08:30 | Symbolic Learning to Optimize (abstract) |
08:52 | Differentiable Cutting-plane Layers for Mixed-integer Linear Optimization (abstract) |
09:14 | Accelerating Non-Convex Optimization via Learned Sequential Convexifications (abstract) |
09:36 | Neuromancer: Differentiable Programming Library for Learning to Optimize and Control (abstract) |
08:30-10:00 Session SunA 7
08:30 | New Sample Complexity Bounds for (Regularized) Sample Average Approximation in Several Heavy-Tailed, Non-Lipschitzian, and High-Dimensional Cases (abstract) |
08:52 | A Distribution Optimization Framework for Confidence Bounds of Risk Measures (abstract) |
09:14 | Self-Structured Importance Sampling for Chance-Constrained Optimization (abstract) |
09:36 | Assessing Feasibility With Respect to Stochastic Constraints (abstract) |
08:30-10:00 Session SunA 8
08:30 | Policy learning without overlap: Pessimism and generalized Bernstein's inequality (abstract) |
08:52 | First-order Methods for Robust Markov Decision Process (abstract) |
09:14 | Provably learning a multi-head attention layer (abstract) |
09:36 | Neural Network-Based Score Estimation in Diffusion Models: Optimization and Generalization (abstract) |
08:30-10:00 Session SunA 9
08:30 | Decision-making with Side Information: A Causal Transport Robust Approach (abstract) |
08:52 | Integrated Conditional Estimation-Optimization (abstract) |
09:14 | Contextual Stochastic Bilevel Optimization (abstract) |
09:36 | SEQUENTIAL COUNTERFACTUAL DECISIONS (abstract) |
08:30-10:00 Session SunA10
08:30 | Adaptive Pricing in Unit Commitment Under Load and Capacity Uncertainty (abstract) |
08:52 | An exact method for a class of robust nonlinear optimization problems (abstract) |
09:14 | Cone product reformulation for global optimization (abstract) |
08:30-10:00 Session SunA11
08:30 | Random block coordinate descent methods for computing optimal transport and convergence analysis (abstract) |
08:52 | Generalizations of R0 and SSM properties for Extended Horizontal Linear Complementarity Problem (abstract) |
09:14 | Solving Large-Scale Non-convex Optimization Problems in Neural Network Verification (abstract) |
13:00-14:30 Session SunB 1
13:00 | Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents (abstract) |
13:22 | Content Creator Incentives in Recommender Systems (abstract) |
13:44 | Convex Optimization-based Algorithms for Strategic Classification (abstract) |
14:06 | Enhancing the Diversity in Language Model Assisted Fundraising (abstract) |
13:00-14:30 Session SunB 2
13:00 | Towards Constituting Mathematical Structures for Learning to Optimize (abstract) |
13:22 | Transformers Meet Image Denoising: Mitigating Over-smoothing in Transformers via Regularized Nonlocal Functionals (abstract) |
13:44 | Advancing Frontiers in DEQs with Applications in OOD Generalization and Diffusion Models (abstract) |
14:06 | Learning to Predict Equilibria in Convex Games (abstract) |
13:00-14:30 Session SunB 3
13:00 | Neural Embedded Optimization over Sets (abstract) |
13:22 | A Bilevel Mixed-Integer Program for the Define-Combine Redistricting Procedure (abstract) |
13:44 | Solving an Advanced Available-to-Promise (AATP) Problem by Optimization and Meta-heuristics Techniques (abstract) |
14:06 | Inverse of the Gomory Corner Relaxation of Integer Programs (abstract) |
13:00-14:30 Session SunB 4
13:00 | On the Convergence of a Decomposition Algorithm for Nonlinear Two-Stage Optimization (abstract) |
13:22 | A Trust Region SQP Algorithm for Equality Constrained Optimization (abstract) |
13:44 | Zeroth-order Riemannian Averaging Stochastic Approximation Algorithms (abstract) |
14:06 | Parsimonious Trajectories in Gradient Descent: Emerging Low-dimensionality in Over-parameterized Models (abstract) |
13:00-14:30 Session SunB 5
13:00 | Riemannian Stochastic Variance-Reduced Cubic Regularized Newton Method (abstract) |
13:22 | Forward-backward Gaussian variational inference via JKO in the Bures-Wasserstein Space (abstract) |
13:44 | Tangent Subspace Descent on Quotient Manifolds (abstract) |
14:06 | Proximal Oracles for Optimization and Sampling (abstract) |
13:00-14:30 Session SunB 6
13:00 | Maximizing and Satisficing in Multi-armed Bandits with Graph Information (abstract) |
13:22 | Branching Adaptive Surrogate Search Method for High-dimensional Optimization (abstract) |
13:44 | Package Queries for Massive-scale In-Database Decision Support (abstract) |
14:06 | Potential Games on Cubic Splines for Multi-Agent Motion Planning (abstract) |
13:00-14:30 Session SunB 7
13:00 | Recycling Valid Inequalities for Robust Optimization (abstract) |
13:22 | A Coordinated Parallelization Algorithm for Compromise Stochastic Programming (abstract) |
13:44 | Branching in the Dual Decomposition Method for Stochastic Integer Programs (abstract) |
14:06 | A Unifying Theory for the Reliability of Stochastic Programming Solutions using Compromise Decisions (abstract) |
13:00-14:30 Session SunB 8
13:00 | Accelerated Gradient Descent via Long Steps (abstract) |
13:22 | Beyond Discretization: Learning the Optimal Solution Path (abstract) |
13:44 | Advancing SGD: Exploring the Interplay of Stochastic Polyak Step-size and Momentum (abstract) |
14:06 | Acceleration of Level Adjustment for the Polyak Stepsize: Applications to Convex and Non-Convex Problems (abstract) |
13:00-14:30 Session SunB 9
13:00 | On graph sequences with finite-time consensus (abstract) |
13:22 | On the use of the finite-time consensus property in decentralized optimization (abstract) |
13:44 | Dual distributed optimization algorithms for potentially disconnected time-varying networks (abstract) |
14:06 | Understanding the Influence of Directed Networks on Decentralized Optimization: Effective Metrics, Lower Bound, and Optimal Algorithm (abstract) |
13:00-14:30 Session SunB10
13:00 | Dimension-Free Zeroth-Order Algorithms for Stochastic Programming Under Dimension-Independent Budget Conditions (abstract) |
13:22 | Efficient and Scalable Reinforcement Learning via Hypermodel (abstract) |
13:44 | On First-Order Meta-Reinforcement Learning with Moreau Envelopes (abstract) |
14:06 | Bayesian optimization of risk based on Student-t process and extreme value statistics (abstract) |
13:00-14:30 Session SunB11
13:00 | Relaxation \& Approximation Algorithm for Solving Sparse PCA Under Robust Uncertainty Set (abstract) |
13:22 | Robust Personalized Design via Bayesian Optimization under Covariate Uncertainty (abstract) |
13:44 | Forecasting Market-Suitable Vegetables by Using a Decision Tree Algorithm (abstract) |
14:45-16:15 Session SunC 1
14:45 | A Conditional Gradient-based Method for Simple Bilevel Optimization with Convex Lower-level Problem (abstract) |
15:07 | Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions (abstract) |
15:29 | SimFBO: Towards Simple, Flexible and Communication-efficient Federated Bilevel Learning (abstract) |
15:51 | On Penalty Methods for Bilevel Optimization (abstract) |
14:45-16:15 Session SunC 2
14:45 | Learning Optimal and Fair Policies for Online Allocation of Scarce Societal Resources from Data Collected in Deployment (abstract) |
15:07 | Wasserstein Robust Classification with Fairness Constraints (abstract) |
15:29 | Learning Fair Policies for Multi-stage Selection Problems from Observational Data (abstract) |
15:51 | On a Fair and Risk-averse Urban Air Mobility Resource Allocation Problem Under Demand and Capacity Uncertainties (abstract) |
14:45-16:15 Session SunC 3
14:45 | A Cycle Cancelling Heuristic for The Traveling Salesman Problem (abstract) |
15:07 | Who Plays First? (abstract) |
15:29 | Flexible Resource Job Scheduling - A Mixed Integer Programming Approach (abstract) |
15:51 | Handling polyhedral symmetries with a dedicated Branch&Cut: application to a knapsack variant (abstract) |
14:45-16:15 Session SunC 4
14:45 | Stochastic Lagrangian-based method for nonconvex optimization with nonlinear constraints (abstract) |
15:07 | A NEAR-OPTIMAL METHOD FOR CONSTRAINED COMPOSITE NON-CONVEX NON-SMOOTH PROBLEMS (abstract) |
15:29 | Solving nonmonotone inclusions and Application to nonconvex QP with equality constraints (abstract) |
15:51 | A Parameter-free and Projection-free Restarting Level Set Method for Constrained Convex Optimization Under the Error Bound Condition} (abstract) |
14:45-16:15 Session SunC 5
14:45 | Certification of sums of squares via low-rank optimization (abstract) |
15:07 | Revisiting Spectral Bundle Methods: Primal-dual (Sub)linear Convergence Rates (abstract) |
15:29 | Convex Relaxation for Fokker-Planck (abstract) |
14:45-16:15 Session SunC 6
14:45 | A Quantile Neural Network Framework for Two-stage Stochastic Optimization (abstract) |
15:07 | A Differentiable Decision Tree Induction Algorithm with Near-optimality (abstract) |
15:29 | Data-driven Decision-making with the Optimization & Machine Learning Toolkit (OMLT) (abstract) |
15:51 | Decomposition and adaptive sampling for data-driven inverse linear optimization (abstract) |
14:45-16:15 Session SunC 7
14:45 | Robust Data-driven Prescriptiveness Optimization (abstract) |
15:07 | Properties of Two-Stage Stochastic Multiobjective Linear Programs (abstract) |
15:29 | Optimizing infrastructure system monitoring under stochastic decision-dependent system failures (abstract) |
15:51 | A distributed algorithm for multi-scale multi-stage stochastic programs with applications to electricity capacity expansion (abstract) |
14:45-16:15 Session SunC 8
14:45 | On Polynomial-Time Solvability of Combinatorial Markov Random Fields (abstract) |
15:07 | Constrained Optimization of Low-rank Functions with Indicator Variables (abstract) |
15:29 | Higher order graphical models and binary polynomial optimization (abstract) |
15:51 | Algorithms for DC Programming via Polyhedral Approximations of Convex Functions (abstract) |
14:45-16:15 Session SunC 9
14:45 | Generalization Performances in Nonconvex Minimax Optimization: A Comprehensive Study (abstract) |
15:07 | Improving Autoencoder Image Interpolation via Dynamic Optimal Transport (abstract) |
15:29 | ALEXR: Optimal Single-Loop Algorithms for Convex Finite-Sum Coupled Compositional Stochastic Optimization (abstract) |
15:51 | Dimension-Insensitive Stochastic First-Order Methods for Nonconvex Optimization (abstract) |
14:45-16:15 Session SunC10
14:45 | Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory (abstract) |
15:07 | Binary Integer Program Approximation and the Induced Structural Duality (abstract) |
15:29 | Rectified Relaxation: A new learning approach for linear optimization with linear and complementary constraints (abstract) |