Cover Image

Inexact Bregman Sparse Newton Method for Efficient Optimal Transport

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pan, Jianting, Li, Ji'an, Yan, Ming
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient sparse probability measures recovery via Bregman gradient
by: Pan, Jianting, et al.
Published: (2024)

Adaptive Regularized Newton Method with Inexact Hessian
by: Shestakov, Aleksandr, et al.
Published: (2025)

Decentralized Inexact Cubic Newton Method with Consensus Procedure
by: Agafonov, Artem, et al.
Published: (2026)

Inexact Newton-type Methods for Optimisation with Nonnegativity Constraints
by: Smee, Oscar, et al.
Published: (2024)

Distributed Inexact Newton Method with Adaptive Step Sizes
by: Jakovetic, Dusan, et al.
Published: (2023)

Well-Posedness and Efficient Algorithms for Inverse Optimal Transport with Bregman Regularization
by: Bao, Chenglong, et al.
Published: (2025)

Inexact Bregman Proximal Gradient Method and its Inertial Variant with Absolute and Partial Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2021)

OFF (Proximal) Newton-type Methods with Inexact Derivatives for Unconstrained Optimization
by: Zhu, Hong
Published: (2025)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
by: Huang, Ziyu, et al.
Published: (2024)

Exploring Jacobian Inexactness in Second-Order Methods for Variational Inequalities: Lower Bounds, Optimal Algorithms and Quasi-Newton Approximations
by: Agafonov, Artem, et al.
Published: (2024)

On the (linear) convergence of Generalized Newton Inexact ADMM
by: Frangella, Zachary, et al.
Published: (2023)

Inexact Newton Methods for Solving Generalized Equations on Riemannian Manifolds
by: Louzeiro, Mauricio S., et al.
Published: (2023)

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2024)

PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport
by: Wu, Di, et al.
Published: (2025)

Bregman Proximal Method for Efficient Communications under Similarity
by: Beznosikov, Aleksandr, et al.
Published: (2023)

Inexact Regularized Quasi-Newton Algorithm for Solving Monotone Variational Inequality Problems
by: Ye, Yuge, et al.
Published: (2025)

Convergence Analysis of an Inexact MBA Method for Constrained DC Problems
by: Liu, Ruyu, et al.
Published: (2025)

A Regularized Hessian-Free Inexact Newton-Type Method with Global $\mathcal{O}(k^{-2})$ Convergence
by: Maia, Leandro Farias, et al.
Published: (2026)

A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport
by: Lin, Tianyi, et al.
Published: (2023)

Sparse Quadratically Constrained Quadratic Programming via Semismooth Newton Method
by: Li, Shuai, et al.
Published: (2025)

A Counterexample to the Optimality Conjecture in Convex Quantum Channel Optimization
by: Yang, Jianting
Published: (2025)

An Inexact Alternating Direction Method of Multipliers for Constrained Parabolic Optimal Distributed Control Problems
by: Song, Haiming, et al.
Published: (2026)

Sparse sum of Hermitian squares in group algebras of finite groups
by: Yang, Jianting, et al.
Published: (2022)

Complexity Guarantees for Nonconvex Newton-MR Under Inexact Hessian Information
by: Lim, Alexander, et al.
Published: (2023)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)

A Gauss-Newton Method for ODE Optimal Tracking Control
by: Holfeld, Vicky, et al.
Published: (2024)

An Inexact Proximal Newton Method for Nonconvex Composite Minimization
by: Zhu, Hong
Published: (2024)

An Inexact Conditional Gradient Method for Constrained Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2023)

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
by: Ding, Kuangyu, et al.
Published: (2024)

Bregman Douglas-Rachford Splitting Method
by: Ma, Shiqian, et al.
Published: (2025)

Inexactly Smooth Performance Estimation and New Optimized Gradient Methods
by: Zoll, Aaron, et al.
Published: (2026)

Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization
by: Eckstein, Jonathan, et al.
Published: (2025)

A Relative Inexact Proximal Gradient Method with an Explicit Linesearch
by: Bello-Cruz, Yunier, et al.
Published: (2024)

On Some Versions of Subspace Optimization Methods with Inexact Gradient Information
by: Kuruzov, Ilya, et al.
Published: (2024)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

An Inexact Preconditioned Zeroth-order Proximal Method for Composite Optimization
by: Liu, Shanglin, et al.
Published: (2024)

Inexact Gauss-Newton methods with matrix approximation by sampling for nonlinear least-squares and systems
by: Bellavia, Stefania, et al.
Published: (2023)

Convergence Rate Bounds for the Mirror Descent Method: IQCs, Popov Criterion and Bregman Divergence
by: Li, Mengmou, et al.
Published: (2023)

On the nature of Bregman functions
by: Pauwels, Edouard
Published: (2023)

Block Coordinate Descent Network Simplex Methods for Optimal Transport
by: Li, Lingrui, et al.
Published: (2025)