Cover Image

Block Coordinate Descent Network Simplex Methods for Optimal Transport

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Lingrui, Yamashita, Nobuo
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Randomized Block Coordinate Descent Method in the Hölder Smooth Setting
by: Maia, Leandro Farias, et al.
Published: (2024)

Block Coordinate Descent Methods for Structured Nonconvex Optimization with Nonseparable Constraints: Optimality Conditions and Global Convergence
by: Yuan, Zhijie, et al.
Published: (2024)

Convergence analysis of a regularized Newton method with generalized regularization terms for convex optimization problems
by: Yamakawa, Yuya, et al.
Published: (2024)

Augmented Lagrangian methods for convex optimization with priority constraints via an infeasibility control framework
by: Yamakawa, Yuya, et al.
Published: (2026)

Projected Block Coordinate Descent for sparse spike estimation
by: Bénard, Pierre-Jean, et al.
Published: (2024)

Distributed Stochastic Block Coordinate Descent for Time-Varying Multi-Agent Optimization
by: Yu, Zhan, et al.
Published: (2019)

Differentially Private Random Block Coordinate Descent
by: Maranjyan, Artavazd, et al.
Published: (2024)

Provably Convergent Plug-and-play Proximal Block Coordinate Descent Method for Hyperspectral Anomaly Detection
by: Liu, Xiaoxia, et al.
Published: (2024)

A strong second-order sequential optimality condition for nonlinear programming problems
by: Li, Huimin, et al.
Published: (2025)

A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints
by: Yuan, Ganzhao
Published: (2023)

Block Acceleration Without Momentum: On Optimal Stepsizes of Block Gradient Descent for Least-Squares
by: Peng, Liangzu, et al.
Published: (2024)

On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms
by: Kamri, Yassine, et al.
Published: (2025)

Stochastic Approximation with Block Coordinate Optimal Stepsizes
by: Jiang, Tao, et al.
Published: (2025)

Asynchronous Decentralized SGD under Non-Convexity: A Block-Coordinate Descent Framework
by: Zhou, Yijie, et al.
Published: (2025)

Frictionless Hamiltonian Descent and Coordinate Hamiltonian Descent for Strongly Convex Quadratic Problems
by: Wang, Jun-Kun
Published: (2024)

Funplex: A Modified Simplex Algorithm to Efficiently Explore Near-Optimal Spaces
by: Funke, Christoph S., et al.
Published: (2024)

SCLP-Simplex Algorithm for Robust Fluid Processing Networks
by: Shindin, Evgeny, et al.
Published: (2024)

Inexact Bregman Sparse Newton Method for Efficient Optimal Transport
by: Pan, Jianting, et al.
Published: (2026)

Asynchronous Distributed Reinforcement Learning for LQR Control via Zeroth-Order Block Coordinate Descent
by: Jing, Gangshan, et al.
Published: (2021)

A Block Coordinate and Variance-Reduced Method for Generalized Variational Inequalities of Minty Type
by: Diakonikolas, Jelena
Published: (2024)

Mirror Descent for Deterministic Optimal Control
by: Feng, Ye, et al.
Published: (2026)

Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
by: Alkousa, Mohammad, et al.
Published: (2024)

Random Coordinate Descent on the Wasserstein Space of Probability Measures
by: Xu, Yewei, et al.
Published: (2026)

A Randomized Block-Coordinate Primal-Dual Method for Large-scale Stochastic Saddle Point Problems
by: Hamedani, Erfan Yazdandoost, et al.
Published: (2019)

Provable Benefit of Random Permutations over Uniform Sampling in Stochastic Coordinate Descent
by: Kim, Donghwa, et al.
Published: (2025)

A Sequential Descent Method for Global Optimization
by: Tifroute, Mohamed, et al.
Published: (2020)

rDSM -- A robust Downhill Simplex Method software package for optimization problems in high dimensions
by: Wang, Tianyu, et al.
Published: (2025)

Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book
by: Bach, Eleon, et al.
Published: (2025)

The Method of Infinite Descent
by: Batley, Reza T., et al.
Published: (2025)

Decentralized Relaxed Smooth Optimization with Gradient Descent Methods
by: Jiang, Zhanhong, et al.
Published: (2025)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
by: Xu, Zeyi, et al.
Published: (2026)

Computing Stationary Distribution via Dirichlet-Energy Minimization by Coordinate Descent
by: Avrachenkov, Konstantin, et al.
Published: (2026)

Quantum Hamiltonian Descent based Augmented Lagrangian Method for Constrained Nonconvex Nonlinear Optimization
by: Li, Mingze, et al.
Published: (2025)

Non-Iterative Solution for Coordinated Optimal Dispatch via Equivalent Projection-Part II: Method and Applications
by: Tan, Zhenfei, et al.
Published: (2023)

A Strengthened Conjecture on the Minimax Optimal Constant Stepsize for Gradient Descent
by: Grimmer, Benjamin, et al.
Published: (2024)

A Proximal Descent Method for Minimizing Weakly Convex Optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

Heuristic Optimal Transport in Branching Networks
by: Andrecut, M.
Published: (2023)

An Optimal Transport Approach for Network Regression
by: Zalles, Alex G., et al.
Published: (2024)

Primal-dual Accelerated Mirror-Descent Method for Constrained Bilinear Saddle-Point Problems
by: Li, Weijian, et al.
Published: (2024)

New merit functions for multiobjective optimization and their properties
by: Tanabe, Hiroki, et al.
Published: (2020)