A fast solver for generalized optimal transport problems based on dynamical system and algebraic multigrid
From MaRDI portal
Publication:6053002
DOI10.1007/s10915-023-02272-9MaRDI QIDQ6053002
Publication date: 25 September 2023
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Lyapunov functionprimal-dual methoddynamical systemalgebraic multigridoptimal transportgraph LaplacianXu-Zikatanov identitysemismooth Newton iteration
Convex programming (90C25) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Acceleration of convergence in numerical analysis (65B99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational Optimal Transport: With Applications to Data Science
- Amplitude and phase variation of point processes
- Optimal multilevel methods for graded bisection grids
- The optimal partial transport problem
- Free boundaries in optimal transport and Monge-Ampère obstacle problems
- Auction algorithms for network flow problems: A tutorial introduction
- Closest matrices in the space of generalized doubly stochastic matrices
- Asymptotic analysis of the exponential penalty trajectory in linear programming
- Remarks on the Monge-Kantorovich problem in the discrete setting
- The earth mover's distance as a metric for image retrieval
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
- Quadratically regularized optimal transport
- Fast Sinkhorn. I: An \(O(N)\) algorithm for the Wasserstein-1 metric
- A multiscale semi-smooth Newton method for optimal transport
- An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems
- Optimal transport: discretization and algorithms
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- A two-level algorithm for the weak Galerkin discretization of diffusion problems
- A nonsmooth version of Newton's method
- Generalized Augmented Matrix Preconditioning Approach and its Application to Iterative Solution of Ill-Conditioned Algebraic Systems
- BPX Preconditioner for Nonstandard Finite Element Methods for Diffusion Problems
- Deriving the X-Z Identity from Auxiliary Space Method*
- Scaling algorithms for unbalanced optimal transport problems
- Multi-physics optimal transportation and image interpolation
- A generalized model for optimal transport of images including dissipation and density modulation
- Parallel Multilevel Preconditioners
- A New Class of Iterative Methods for Nonselfadjoint or Indefinite Problems
- The method of alternating projections and the method of subspace corrections in Hilbert space
- A Multigrid Tutorial, Second Edition
- Algebraic multigrid methods
- Convergence analysis of V-Cycle multigrid methods for anisotropic elliptic equations
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Two-Grid Discretization Techniques for Linear and Nonlinear PDE<scp>s</scp>
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Convergence analysis of the Fast Subspace Descent method for convex optimization problems
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- Iterative Bregman Projections for Regularized Transportation Problems
- Analysis of a Two-Level Algorithm for HDG Methods for Diffusion Problems
- ROBUST SUBSPACE CORRECTION METHODS FOR NEARLY SINGULAR SYSTEMS
- Computing the Nearest Doubly Stochastic Matrix with A Prescribed Entry
- Optimal transportation with capacity constraints
- Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
- A primal-dual flow for affine constrained convex optimization
- Optimal transportation, modelling and numerical simulation
- Convex analysis and monotone operator theory in Hilbert spaces
- Accelerated differential inclusion for convex optimization
