A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
Not on the map. Why?
Abstract (arXiv)
The optimal transport (OT) problem and its related problems have attracted significant attention and have been extensively studied in various applications. In this paper, we focus on a class of group-quadratic regularized OT problems which aim to find solutions with specialized structures that are advantageous in practical scenarios. To solve this class of problems, we propose a corrected inexact proximal augmented Lagrangian method (ciPALM), with the subproblems being solved by the semi-smooth Newton (sc Ssn) method. We establish that the proposed method exhibits appealing convergence properties under mild conditions. Moreover, our ciPALM distinguishes itself from the recently developed semismooth Newton-based inexact proximal augmented Lagrangian (sc Snipal) method for linear programming. Specifically, sc Snipal uses an absolute error criterion for the approximate minimization of the subproblem for which a summable sequence of tolerance parameters needs to be pre-specified for practical implementations. In contrast, our ciPALM adopts a relative error criterion with a textitsingle tolerance parameter, which would be more friendly to tune from computational and implementation perspectives. These favorable properties position our ciPALM as a promising candidate for tackling large-scale problems. Various numerical studies validate the effectiveness of employing a relative error criterion for the inexact proximal augmented Lagrangian method, and also demonstrate that our ciPALM is competitive for solving large-scale group-quadratic regularized OT problems.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Nov 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 1; 2026: 1.
4 papers.
- 2025PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transportcited by 5
- 2024An Inexact Halpern Iteration with Application to Distributionally Robust Optimizationcited by 2
- 2024Accelerating Multi-Block Constrained Optimization Through Learning to Optimizecited by 2
- 2026A Provably Convergent and Practical Algorithm for Gromov--Wasserstein Optimal Transportcited by 0
- 2026A Provably Convergent and Practical Algorithm for Gromov--Wasserstein Optimal Transport5 May 2026
- 2025PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport6 Feb 2025
- 2024Accelerating Multi-Block Constrained Optimization Through Learning to Optimize25 Sep 2024
- 2024An Inexact Halpern Iteration with Application to Distributionally Robust Optimization8 Feb 2024