Copertina

An inexact Bregman proximal point method and its acceleration version for unbalanced optimal transport

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Xiang, Wang, Faqiang, Liu, Jun, Cui, Li
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Bregman firmly nonexpansive proximal operator for baryconvex optimization
di: Achab, Mastane
Pubblicazione: (2024)

The inexact power augmented Lagrangian method for constrained nonconvex optimization
di: Bodard, Alexander, et al.
Pubblicazione: (2024)

An adaptively inexact first-order method for bilevel optimization with application to hyperparameter learning
di: Salehi, Mohammad Sadegh, et al.
Pubblicazione: (2023)

An inexact LPA for DC composite optimization and application to matrix completions with outliers
di: Tao, Ting, et al.
Pubblicazione: (2023)

An inexact variable metric proximal linearization method for composite optimization on manifolds
di: He, Hao, et al.
Pubblicazione: (2025)

Efficient algorithms for implementing incremental proximal-point methods
di: Shtoff, Alex
Pubblicazione: (2022)

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
di: Liu, Ruyu, et al.
Pubblicazione: (2023)

Learning stochastic dynamics from snapshots through regularized unbalanced optimal transport
di: Zhang, Zhenyi, et al.
Pubblicazione: (2024)

A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees
di: Li, Shuyao, et al.
Pubblicazione: (2023)

Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms
di: Chen, He, et al.
Pubblicazione: (2024)

Variable Bregman Majorization-Minimization Algorithm and its Application to Dirichlet Maximum Likelihood Estimation
di: Martin, Ségolène, et al.
Pubblicazione: (2025)

Variance reduction techniques for stochastic proximal point algorithms
di: Traoré, Cheik, et al.
Pubblicazione: (2023)

Characterizations of inexact proximal operators
di: Lauga, Guillaume, et al.
Pubblicazione: (2026)

An accelerated proximal bundle method for convex optimization
di: Liao, Feng-Yi, et al.
Pubblicazione: (2025)

Group-blind optimal transport to group parity and its constrained variants
di: Zhou, Quan, et al.
Pubblicazione: (2023)

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

Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization
di: Vernimmen, Pierre, et al.
Pubblicazione: (2025)

Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness
di: Agafonov, Artem, et al.
Pubblicazione: (2023)

Online Nonconvex Bilevel Optimization with Bregman Divergences
di: Bohne, Jason, et al.
Pubblicazione: (2024)

Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning
di: Ding, Kuangyu, et al.
Pubblicazione: (2023)

Simple unbalanced optimal transport
di: Khesin, Boris, et al.
Pubblicazione: (2023)

Robust Sublinear Convergence Rates for Iterative Bregman Projections
di: Peyré, Gabriel
Pubblicazione: (2026)

Bregman Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Zeroth-order Optimization
di: Shi, Qiankun, et al.
Pubblicazione: (2025)

Domain decomposition for entropic unbalanced optimal transport
di: Medina, Ismael, et al.
Pubblicazione: (2024)

Semi-discrete unbalanced optimal transport and quantization
di: Bourne, David P., et al.
Pubblicazione: (2018)

Point source localisation with unbalanced optimal transport
di: Valkonen, Tuomo
Pubblicazione: (2025)

Regularity theory and geometry of unbalanced optimal transport
di: Gallouët, Thomas, et al.
Pubblicazione: (2021)

Mean-square and linear convergence of a stochastic proximal point algorithm in metric spaces of nonpositive curvature
di: Pischke, Nicholas
Pubblicazione: (2025)

Path constrained unbalanced optimal transport
di: Bauer, Martin, et al.
Pubblicazione: (2024)

A simple uniformly optimal method without line search for convex optimization
di: Li, Tianjiao, et al.
Pubblicazione: (2023)

Learning to accelerate Krasnosel'skii-Mann fixed-point iterations with guarantees
di: Martin, Andrea, et al.
Pubblicazione: (2026)

A successive approximation method in functional spaces for hierarchical optimal control problems and its application to learning
di: Befekadu, Getachew K.
Pubblicazione: (2024)

Symmetrizing Bregman Divergence on the Cone of Positive Definite Matrices: Which Mean to Use and Why
di: Sial, Tushar, et al.
Pubblicazione: (2026)

Local adapt-then-combine algorithms for distributed nonsmooth optimization: Achieving provable communication acceleration
di: Guo, Luyao, et al.
Pubblicazione: (2026)

Continuum-marginal optimal transport: a mesh-free kernel method
di: Nakano, Yumiharu
Pubblicazione: (2026)

Convergence of empirical subgradients for optimal transport-based objectives
di: Le, Tam
Pubblicazione: (2026)

Frugality in second-order optimization: floating-point approximations for Newton's method
di: Carrino, Giuseppe, et al.
Pubblicazione: (2025)

Dealing with unbounded gradients in stochastic saddle-point optimization
di: Neu, Gergely, et al.
Pubblicazione: (2024)

A strongly convergent inertial inexact proximal-point algorithm for monotone inclusions with applications to variational inequalities
di: Alves, M. Marques, et al.
Pubblicazione: (2024)

On the convergence of discrete dynamic unbalanced transport models
di: Li, Bowen, et al.
Pubblicazione: (2023)