:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Graur, Andrei, Jiang, Haotian, Sidford, Aaron
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms Optimization and Control
Online Access:	https://arxiv.org/abs/2309.16632
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
by: Chen, Li, et al.
Published: (2025)

On computing approximate Lewis weights
by: Apers, Simon, et al.
Published: (2024)

Entropy Regularization and Faster Decremental Matching in General Graphs
by: Chen, Jiale, et al.
Published: (2023)

Quantum speedups for stochastic optimization
by: Sidford, Aaron, et al.
Published: (2023)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
by: Adil, Deeksha, et al.
Published: (2025)

Convex optimization with $p$-norm oracles
by: Adil, Deeksha, et al.
Published: (2024)

Reusing Samples in Variance Reduction
by: Jin, Yujia, et al.
Published: (2025)

Extracting Dual Solutions via Primal Optimizers
by: Carmon, Yair, et al.
Published: (2024)

Isotropic Noise in Stochastic and Quantum Convex Optimization
by: Marsden, Annie, et al.
Published: (2025)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
by: Jambulapati, Arun, et al.
Published: (2024)

Submodular Order Functions and Assortment Optimization
by: Udwani, Rajan
Published: (2021)

Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure
by: Dereziński, Michał, et al.
Published: (2025)

Truncated Variance Reduced Value Iteration
by: Jin, Yujia, et al.
Published: (2024)

Discrete and Continuous Difference of Submodular Minimization
by: Orfanides, George, et al.
Published: (2025)

Solving Matrix Games with Near-Optimal Matvec Complexity
by: Karmarkar, Ishani, et al.
Published: (2026)

Solving Zero-Sum Games with Fewer Matrix-Vector Products
by: Karmarkar, Ishani, et al.
Published: (2025)

Efficient Convex Optimization Requires Superlinear Memory
by: Marsden, Annie, et al.
Published: (2022)

Difference of Submodular Minimization via DC Programming
by: Halabi, Marwa El, et al.
Published: (2023)

Algorithmically Fair Maximization of Multiple Submodular Objective Functions
by: Amanatidis, Georgios, et al.
Published: (2024)

A 1/2-Approximation for Budgeted $k$-Submodular Maximization
by: Wang, Chenhao
Published: (2025)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
by: Gallart, Joan Vendrell, et al.
Published: (2025)

Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization
by: Liu, Yang P., et al.
Published: (2025)

Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
by: Chen, Shengminjie, et al.
Published: (2026)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
by: Blankenburg, Daniel, et al.
Published: (2025)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2025)

Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
by: Zhang, Hongyang R., et al.
Published: (2023)

Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
by: Adil, Deeksha, et al.
Published: (2024)

Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
by: Hu, Hins, et al.
Published: (2025)

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
by: Wang, Hao, et al.
Published: (2024)

Combinatorial Sparse PCA Beyond the Spiked Identity Model
by: Kumar, Syamantak, et al.
Published: (2026)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
by: Gu, Yuzhou, et al.
Published: (2023)

Labeling Methods for Partially Ordered Paths
by: Euler, Ricardo, et al.
Published: (2023)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
by: Cole, Richard, et al.
Published: (2023)

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
by: Altschuler, Jason M., et al.
Published: (2023)

Dynamic Pricing for Reusable Resources: The Power of Two Prices
by: Balseiro, Santiago R., et al.
Published: (2023)

Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
by: Chen, Shengminjie, et al.
Published: (2023)

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
by: Bhimaraju, Akhil, et al.
Published: (2023)

Parameterized algorithms for block-structured integer programs with large entries
by: Cslovjecsek, Jana, et al.
Published: (2023)

When Location Shapes Choice: Placement Optimization of Substitutable Products
by: Housni, Omar El, et al.
Published: (2023)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)