Cover Image

Convex relaxation approaches for high-dimensional optimal transport

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Khoo, Yuehaw, Tang, Tianyun
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Numerical Analysis Computation 49Q22, 90C06, 90C22
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
by: Chen, Liang, et al.
Published: (2025)

Nesterov's Accelerated Jacobi-Type Methods for Large-scale Symmetric Positive Semidefinite Linear Systems
by: Liang, Ling, et al.
Published: (2024)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
by: Tang, Tianyun, et al.
Published: (2026)

An augmented Lagrangian method for strongly regular minimizers in a class of convex composite optimization problems
by: Wang, Chengjing, et al.
Published: (2025)

Variational models of robust optimal transport
by: De Masi, Luigi, et al.
Published: (2025)

An Efficient Augmented Lagrangian Method for Dynamic Optimal Transport on Surfaces Based on Second-Order Cone Programming
by: Chen, Liang, et al.
Published: (2025)

Empirical risk minimization for risk-neutral composite optimal control with applications to bang-bang control
by: Milz, Johannes, et al.
Published: (2024)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
by: Hou, Di, et al.
Published: (2025)

Time-Varying Semidefinite Programming: Path Following a Burer-Monteiro Factorization
by: Bellon, Antonio, et al.
Published: (2022)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
by: Rubbens, Anne, et al.
Published: (2024)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
by: Deng, Kangkang, et al.
Published: (2024)

Bilevel Optimization of the Kantorovich Problem and its Quadratic Regularization Part III: The Finite-Dimensional Case
by: Hillbrecht, Sebastian
Published: (2024)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
by: Tang, Tianyun, et al.
Published: (2024)

A squared smoothing Newton method for semidefinite programming
by: Liang, Ling, et al.
Published: (2023)

On the Wasserstein alignment problem
by: Pal, Soumik, et al.
Published: (2025)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
by: Bousselmi, Nizar, et al.
Published: (2023)

A dynamical formulation of multi-marginal optimal transport
by: Pass, Brendan, et al.
Published: (2025)

On the directional asymptotic approach in optimization theory
by: Benko, Matúš, et al.
Published: (2024)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
by: Loris, Ignace, et al.
Published: (2023)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
by: Marumo, Hiroki, et al.
Published: (2024)

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
by: Bomze, Immanuel, et al.
Published: (2024)

Connections between Bressan's Mixing Conjecture, the Branched Optimal Transport and Combinatorial Optimization
by: Zhou, Bohan
Published: (2024)

Strong Variational Sufficiency for Nonlinear Semidefinite Programming and its Implications
by: Wang, Shiwei, et al.
Published: (2022)

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
by: Liang, Ling, et al.
Published: (2024)

Chaos propagation in genetic algorithms: An optimal transport approach
by: Borghi, Giacomo
Published: (2026)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
by: Halaseh, Sami, et al.
Published: (2026)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
by: Zhang, Rui-Jin, et al.
Published: (2025)

Characterizations of the Aubin Property of the Solution Mapping for Nonlinear Semidefinite Programming
by: Chen, Liang, et al.
Published: (2024)

On exactness of SDP relaxation for the maximum cut problem
by: Bhardwaj, Avinash, et al.
Published: (2025)

Topology optimization and boundary observation for clamped plates
by: Murea, Cornel Marius, et al.
Published: (2023)

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
by: Wang, Xuejie, et al.
Published: (2023)

Dimension reduction, exact recovery, and error estimates for sparse reconstruction in phase space
by: Holler, Martin, et al.
Published: (2021)

Sparse convex relaxations in polynomial optimization
by: Averkov, Gennadiy, et al.
Published: (2024)

Perturbation analysis of a class of composite optimization problems
by: Tang, Peipei, et al.
Published: (2024)

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
by: Huang, Queenie Yingkun, et al.
Published: (2024)

Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
by: Ostermann, Birte, et al.
Published: (2025)

An interacting particle consensus method for constrained global optimization
by: Carrillo, José A., et al.
Published: (2024)

Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithm
by: Wang, Chengjing, et al.
Published: (2023)

Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
by: Kong, Weiwei
Published: (2022)