Copertina

On Speedups for Convex Optimization via Quantum Dynamics

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chakrabarti, Shouvanik, Herman, Dylan, Watkins, Jacob, Fontana, Enrico, Augustino, Brandon, Kim, Junhyung Lyle, Pistoia, Marco
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Quantum Physics Data Structures and Algorithms Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Quantum Speedups for Group Relaxations of Integer Linear Programs
di: Augustino, Brandon, et al.
Pubblicazione: (2026)

Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization
di: Chakrabarti, Shouvanik, et al.
Pubblicazione: (2024)

Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
di: Herman, Dylan, et al.
Pubblicazione: (2025)

Fast Convex Optimization with Quantum Gradient Methods
di: Augustino, Brandon, et al.
Pubblicazione: (2025)

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

Quantum Speedups for Derivative Pricing Beyond Black-Scholes
di: Herman, Dylan, et al.
Pubblicazione: (2026)

A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
di: Chen, Tyler, et al.
Pubblicazione: (2025)

A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm
di: Kim, Junhyung Lyle, et al.
Pubblicazione: (2024)

A quantum central path algorithm for linear optimization
di: Augustino, Brandon, et al.
Pubblicazione: (2023)

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

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

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

Negative Momentum for Convex-Concave Optimization
di: Shugart, Henry, et al.
Pubblicazione: (2026)

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

Optimal Decentralized Smoothed Online Convex Optimization
di: Bhuyan, Neelkamal, et al.
Pubblicazione: (2024)

Convex Optimization with Nested Evolving Feasible Sets
di: M., Karthick Krishna, et al.
Pubblicazione: (2026)

Solving the Probabilistic Profitable Tour Problem on a Tree
di: Angelelli, Enrico, et al.
Pubblicazione: (2022)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
di: Sun, Shuo, et al.
Pubblicazione: (2024)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
di: Ferreira, Ricardo N., et al.
Pubblicazione: (2025)

Non-Euclidean High-Order Smooth Convex Optimization
di: Contreras, Juan Pablo, et al.
Pubblicazione: (2024)

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

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
di: Shah, Harsh, et al.
Pubblicazione: (2025)

Optimization in Sanger Sequencing
di: Carpente, Luisa, et al.
Pubblicazione: (2024)

Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
di: Brubaker, Kyle, et al.
Pubblicazione: (2025)

Submodular Order Functions and Assortment Optimization
di: Udwani, Rajan
Pubblicazione: (2021)

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

Quasi-Self-Concordant Optimization with Lewis Weights
di: Ene, Alina, et al.
Pubblicazione: (2025)

A Decomposition Theorem for Dynamic Flows
di: Graf, Lukas, et al.
Pubblicazione: (2024)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
di: Chang, Claire, et al.
Pubblicazione: (2026)

Optimized methods for composite optimization: a reduction perspective
di: Bok, Jinho, et al.
Pubblicazione: (2025)

Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
di: Nerem, Robert R., et al.
Pubblicazione: (2024)

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

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
di: Housni, Omar El, et al.
Pubblicazione: (2024)

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

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

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

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
di: Segev, Danny
Pubblicazione: (2025)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
di: Su, Yuexin, et al.
Pubblicazione: (2026)

Oracle-based Uniform Sampling from Convex Bodies
di: Dang, Thanh, et al.
Pubblicazione: (2025)

Quantum Langevin Dynamics for Optimization
di: Chen, Zherui, et al.
Pubblicazione: (2023)