An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
From MaRDI portal
Publication:2701420
DOI10.1007/s10589-023-00459-2OpenAlexW4322009178MaRDI QIDQ2701420
Ling Liang, Hong T. M. Chu, Kim-Chuan Toh, Lei Yang
Publication date: 28 April 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.14312
linear programmingblock coordinate descentproximal point algorithmcapacity constrained multi-marginal optimal transportentropic proximal term
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational Optimal Transport: With Applications to Data Science
- Tomographic reconstruction from a few views: a multi-marginal optimal transport approach
- Multiplicative iterative algorithms for convex programming
- An iterative row-action method for interval convex programming
- Approximate iterations in Bregman-function-based proximal algorithms
- On the convergence of the coordinate descent method for convex differentiable minimization
- Proximal minimization algorithm with \(D\)-functions
- Variational methods for tomographic reconstruction with few views
- Solving multistage stochastic network programs on massively prallel computers
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Dual coordinate ascent methods for non-strictly convex minimization
- Dykstras algorithm with bregman projections: A convergence proof
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- An Algorithm for Restricted Least Squares Regression
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- Variational Analysis
- Convergence of Proximal-Like Algorithms
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Entropy-Like Proximal Methods in Convex Programming
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Iterative Bregman Projections for Regularized Transportation Problems
- Optimal transportation with capacity constraints
- Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
- Convex Analysis
