A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-Quadratic Regularized Optimal Transport Problems
From MaRDI portal
Publication:6500198
DOI10.1007/S10915-024-02549-7MaRDI QIDQ6500198
Hong T. M. Chu, Kim-Chuan Toh, Lei Yang, Ling Liang
Publication date: 10 May 2024
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On a problem of optimal transport under marginal martingale constraints
- Model-independent bounds for option prices -- a mass transport approach
- A practical relative error criterion for augmented Lagrangians
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- The optimal partial transport problem
- Free boundaries in optimal transport and Monge-Ampère obstacle problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- The earth mover's distance as a metric for image retrieval
- Quadratically regularized optimal transport
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- Computational methods for martingale optimal transport problems
- A nonsmooth version of Newton's method
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
- A Smoothed Dual Approach for Variational Wasserstein Problems
- Quadratically Regularized Optimal Transport on Graphs
- Multi-marginal optimal transport: Theory and applications
- A Class of Inexact Variable Metric Proximal Point Algorithms
- Monotone Operators and the Proximal Point Algorithm
- Semismooth and Semiconvex Functions in Constrained Optimization
- Optimal maps for the multidimensional Monge-Kantorovich problem
- Variational Analysis
- Probability
- On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- ROBUST BOUNDS FOR FORWARD START OPTIONS
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- Regularized Discrete Optimal Transport
- Iterative Bregman Projections for Regularized Transportation Problems
- SAMPLING OF ONE-DIMENSIONAL PROBABILITY MEASURES IN THE CONVEX ORDER AND COMPUTATION OF ROBUST OPTION PRICE BOUNDS
- Convex Analysis
- Semismooth Matrix-Valued Functions
- A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering
- QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-Quadratic Regularized Optimal Transport Problems