Image de couverture de livre

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Ying, Koch, Thorsten, Peng, Hanqiu, Zhang, Hongrui
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
par: Tyurin, Alexander
Publié: (2024)

A System-Dynamic Based Simulation and Bayesian Optimization for Inventory Management
par: Maitra, Sarit
Publié: (2024)

Information Redistribution Under Reductions in NP Search
par: Wei, Jing-Yuan
Publié: (2026)

The Complexity of Computing KKT Solutions of Quadratic Programs
par: Fearnley, John, et autres
Publié: (2023)

Counterfactual Explanations for Integer Optimization Problems
par: Engelhardt, Felix, et autres
Publié: (2025)

(Sub)Exponential Quantum Speedup for Optimization
par: Leng, Jiaqi, et autres
Publié: (2025)

Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
par: Boche, Holger, et autres
Publié: (2025)

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
par: Hollender, Alexandros, et autres
Publié: (2023)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
par: Figueira, José Rui, et autres
Publié: (2024)

Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
par: Sim, Chee-Khian
Publié: (2024)

A parallel framework for graphical optimal transport
par: Fan, Jiaojiao, et autres
Publié: (2024)

Query-Efficient Zeroth-Order Algorithms for Nonconvex Constrained Optimization
par: Jin, Ruiyang, et autres
Publié: (2025)

The Complexity of Recognizing Facets for the Knapsack Polytope
par: Chen, Rui, et autres
Publié: (2022)

Learning complexity of gradient descent and conjugate gradient algorithms
par: Jiao, Xianqi, et autres
Publié: (2024)

Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
par: Lu, Yiyang, et autres
Publié: (2025)

Linear Equations with Min and Max Operators: Computational Complexity
par: Chatterjee, Krishnendu, et autres
Publié: (2024)

Intrinsic Sequentiality in P: Causal Limits of Parallel Computation
par: Wei, Jing-Yuan
Publié: (2026)

Towards Exponential Quantum Improvements in Solving Cardinality-Constrained Binary Optimization
par: Yuan, Haomu, et autres
Publié: (2026)

On the Complexity of p-Order Cone Programs
par: Blanco, Víctor, et autres
Publié: (2025)

Efficient LP warmstarting for linear modifications of the constraint matrix
par: Derval, Guillaume, et autres
Publié: (2025)

On the Degree Automatability of Sum-of-Squares Proofs
par: Bortolotti, Alex, et autres
Publié: (2025)

Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
par: Büsing, Christina, et autres
Publié: (2025)

A parameterized linear formulation of the integer hull
par: Eisenbrand, Friedrich, et autres
Publié: (2025)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
par: Ketkov, Sergey S., et autres
Publié: (2024)

Hardness of some optimization problems over correlation polyhedra
par: Caprara, Alberto, et autres
Publié: (2026)

On the Induced Norms of Matrices and Grothendieck problems
par: Truong, Lan V., et autres
Publié: (2026)

Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
par: Majumdar, Angshul
Publié: (2026)

Avoiding Deadlocks via Weak Deadlock Sets
par: Oriolo, Gianpaolo, et autres
Publié: (2024)

Geometric and computational hardness of bilevel programming
par: Bolte, Jérôme, et autres
Publié: (2024)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
par: Lee, Jongmin, et autres
Publié: (2026)

On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification
par: Ketkov, Sergey S., et autres
Publié: (2026)

From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization
par: Pedramfar, Mohammad, et autres
Publié: (2024)

Second-Order Min-Max Optimization with Lazy Hessians
par: Chen, Lesi, et autres
Publié: (2024)

Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
par: Bhargav, Jayanth, et autres
Publié: (2024)

Diffusion-Robust Optimization over Graphs
par: Aolaritei, Liviu, et autres
Publié: (2026)

Real Stability and Log Concavity are coNP-Hard
par: Chin, Tracy
Publié: (2024)

A Control-Theoretic Perspective on Optimal High-Order Optimization
par: Lin, Tianyi, et autres
Publié: (2019)

On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
par: Kurpisz, Adam, et autres
Publié: (2026)

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
par: Borzechowski, Michaela, et autres
Publié: (2024)

On Approximate Computation of Critical Points
par: Ahmadi, Amir Ali, et autres
Publié: (2026)