Copertina

A parallel framework for graphical optimal transport

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Fan, Jiaojiao, Haasler, Isabel, Zhang, Qinsheng, Karlsson, Johan, Chen, Yongxin
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Graph-structured tensor optimization for nonlinear density control and mean field games
di: Ringh, Axel, et al.
Pubblicazione: (2021)

Mixtures of ensembles: System separation and identification via optimal transport
di: Elvander, Filip, et al.
Pubblicazione: (2025)

Multi-frequency tracking via group-sparse optimal transport
di: Haasler, Isabel, et al.
Pubblicazione: (2024)

Hardness of some optimization problems over correlation polyhedra
di: Caprara, Alberto, et al.
Pubblicazione: (2026)

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
di: Chen, Ying, et al.
Pubblicazione: (2025)

The Complexity of Recognizing Facets for the Knapsack Polytope
di: Chen, Rui, et al.
Pubblicazione: (2022)

Learning complexity of gradient descent and conjugate gradient algorithms
di: Jiao, Xianqi, et al.
Pubblicazione: (2024)

A parameterized linear formulation of the integer hull
di: Eisenbrand, Friedrich, et al.
Pubblicazione: (2025)

A System-Dynamic Based Simulation and Bayesian Optimization for Inventory Management
di: Maitra, Sarit
Pubblicazione: (2024)

On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification
di: Ketkov, Sergey S., et al.
Pubblicazione: (2026)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
di: Ketkov, Sergey S., et al.
Pubblicazione: (2024)

Avoiding Deadlocks via Weak Deadlock Sets
di: Oriolo, Gianpaolo, et al.
Pubblicazione: (2024)

Geometric and computational hardness of bilevel programming
di: Bolte, Jérôme, et al.
Pubblicazione: (2024)

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

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
di: Tyurin, Alexander
Pubblicazione: (2024)

On the Complexity of p-Order Cone Programs
di: Blanco, Víctor, et al.
Pubblicazione: (2025)

On the Induced Norms of Matrices and Grothendieck problems
di: Truong, Lan V., et al.
Pubblicazione: (2026)

Efficient LP warmstarting for linear modifications of the constraint matrix
di: Derval, Guillaume, et al.
Pubblicazione: (2025)

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

On the Degree Automatability of Sum-of-Squares Proofs
di: Bortolotti, Alex, et al.
Pubblicazione: (2025)

Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
di: Büsing, Christina, et al.
Pubblicazione: (2025)

Counterfactual Explanations for Integer Optimization Problems
di: Engelhardt, Felix, et al.
Pubblicazione: (2025)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
di: Lee, Jongmin, et al.
Pubblicazione: (2026)

The Complexity of Computing KKT Solutions of Quadratic Programs
di: Fearnley, John, et al.
Pubblicazione: (2023)

Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
di: Boche, Holger, et al.
Pubblicazione: (2025)

Information Redistribution Under Reductions in NP Search
di: Wei, Jing-Yuan
Pubblicazione: (2026)

Accelerating genetic optimization of nonlinear model predictive control by learning optimal search space size
di: Mostafa, Eslam, et al.
Pubblicazione: (2023)

Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
di: Bhargav, Jayanth, et al.
Pubblicazione: (2024)

Query-Efficient Zeroth-Order Algorithms for Nonconvex Constrained Optimization
di: Jin, Ruiyang, et al.
Pubblicazione: (2025)

A direct optimization algorithm for input-constrained MPC
di: Wu, Liang, et al.
Pubblicazione: (2023)

Real Stability and Log Concavity are coNP-Hard
di: Chin, Tracy
Pubblicazione: (2024)

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
di: Borzechowski, Michaela, et al.
Pubblicazione: (2024)

A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
di: Liu, Wei, et al.
Pubblicazione: (2025)

Solving The Travelling Salesman Problem Using A Single Qubit
di: Goswami, Kapil, et al.
Pubblicazione: (2024)

From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization
di: Pedramfar, Mohammad, et al.
Pubblicazione: (2024)

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

Solving convex QPs with structured sparsity under indicator conditions
di: Bienstock, Daniel, et al.
Pubblicazione: (2024)

Linear Equations with Min and Max Operators: Computational Complexity
di: Chatterjee, Krishnendu, et al.
Pubblicazione: (2024)

Benign landscape for Burer-Monteiro factorizations of MaxCut-type semidefinite programs
di: Endor, Faniriana Rakoto, et al.
Pubblicazione: (2024)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
di: Figueira, José Rui, et al.
Pubblicazione: (2024)