An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization

Documenti analoghi

• An Efficient Augmented Lagrangian Method for Dynamic Optimal Transport on Surfaces Based on Second-Order Cone Programming
  di: Chen, Liang, et al.
  Pubblicazione: (2025)
• Fast projection onto the top-k-sum constraint
  di: Pan, Jianting, et al.
  Pubblicazione: (2025)
• Convex relaxation approaches for high-dimensional optimal transport
  di: Khoo, Yuehaw, et al.
  Pubblicazione: (2025)
• ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
  di: Kabgani, Alireza, et al.
  Pubblicazione: (2024)
• Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
  di: Bot, Radu Ioan, et al.
  Pubblicazione: (2024)