Copertina

Delay-tolerant distributed Bregman proximal algorithms

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chraibi, S., Iutzeler, F., Malick, J., Rogozin, A.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
di: Azizian, Waïss, et al.
Pubblicazione: (2022)

Approximate Bregman proximal gradient algorithm with variable metric Armijo--Wolfe line search
di: Fujiki, Kiwamu, et al.
Pubblicazione: (2025)

Average-case optimization analysis for distributed consensus algorithms on regular graphs
di: Nguyen, Nhat Trung, et al.
Pubblicazione: (2024)

A Parameter-Free Zeroth-Order Algorithm for Decentralized Stochastic Convex Optimization
di: Chen, Jiawei, et al.
Pubblicazione: (2026)

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

What is the long-run distribution of stochastic gradient descent? A large deviations analysis
di: Azizian, Waïss, et al.
Pubblicazione: (2024)

$\texttt{skwdro}$: a library for Wasserstein distributionally robust machine learning
di: Vincent, Florian, et al.
Pubblicazione: (2024)

Universal generalization guarantees for Wasserstein distributionally robust models
di: Le, Tam, et al.
Pubblicazione: (2024)

Derivatives of Stochastic Gradient Descent in parametric optimization
di: Iutzeler, Franck, et al.
Pubblicazione: (2024)

An inexact Bregman proximal point method and its acceleration version for unbalanced optimal transport
di: Chen, Xiang, et al.
Pubblicazione: (2024)

Majorization-minimization Bregman proximal gradient algorithms for NMF with the Kullback--Leibler divergence
di: Takahashi, Shota, et al.
Pubblicazione: (2024)

Variable Bregman Majorization-Minimization algorithms for nonconvex nonsmooth optimization, with application to Poisson imaging
di: Adly, Maxence, et al.
Pubblicazione: (2026)

On the nature of Bregman functions
di: Pauwels, Edouard
Pubblicazione: (2023)

Inexact JKO and proximal-gradient algorithms in the Wasserstein space
di: Di Marino, Simone, et al.
Pubblicazione: (2025)

Bregman-divergence-based Arimoto-Blahut algorithm
di: Hayashi, Masahito
Pubblicazione: (2024)

Bregman level proximal subdifferentials and new characterizations of Bregman proximal operators
di: Wang, Ziyuan, et al.
Pubblicazione: (2025)

The global convergence time of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviations
di: Azizian, Waïss, et al.
Pubblicazione: (2025)

The Mirror-Prox Sliding Method for Non-smooth decentralized saddle-point problems
di: Kuruzov, Ilya, et al.
Pubblicazione: (2022)

On the proximal point algorithm for strongly quasiconvex functions in Hadamard spaces
di: Pischke, Nicholas
Pubblicazione: (2024)

Projected proximal gradient trust-region algorithm for nonsmooth optimization
di: Dao, Minh N., et al.
Pubblicazione: (2025)

Bregman proximal gradient method for linear optimization under entropic constraints
di: Briceño-Arias, Luis M., et al.
Pubblicazione: (2025)

Bregman three-operator splitting methods
di: Jiang, Xin, et al.
Pubblicazione: (2022)

Optimization of Bregman Variational Learning Dynamics
di: Cha, Jinho, et al.
Pubblicazione: (2025)

Decentralized Optimization with Mixed Affine Constraints
di: Yarmoshik, Demyan, et al.
Pubblicazione: (2026)

A proximal subgradient algorithm for constrained multiobjective DC-type optimization
di: Van Tuyen, Nguyen, et al.
Pubblicazione: (2025)

Convergence of zeroth-order proximal point algorithms in the high-temperature regime
di: Naldi, Emanuele, et al.
Pubblicazione: (2026)

Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems
di: Savchuk, O. S., et al.
Pubblicazione: (2024)

Knapsack with compactness: a semidefinite approach
di: Villuendas, Hubert, et al.
Pubblicazione: (2025)

Extended alternating structure-adapted proximal gradient algorithm for nonconvex nonsmooth problems
di: Gao, Ying, et al.
Pubblicazione: (2024)

Box-constrained L0 Bregman-relaxations
di: Essafri, Mhamed, et al.
Pubblicazione: (2025)

Robustifying networks for flow problems against edge failure
di: Klyuchikov, Artyom, et al.
Pubblicazione: (2025)

Dual Smoothing for Decentralized Optimization
di: Rogozin, Alexander, et al.
Pubblicazione: (2025)

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

Beyond Quadratic Costs in LQR: Bregman Divergence Control
di: Hassibi, Babak, et al.
Pubblicazione: (2025)

An equivalent reformulation and multi-proximity gradient algorithms for a class of nonsmooth fractional programming
di: Zhou, Junpeng, et al.
Pubblicazione: (2023)

A relaxed proximal point algorithm with double-inertial effects for nonconvex equilibrium problems
di: Van Tran, Nam
Pubblicazione: (2025)

Inertial Bregman Proximal Gradient under Partial Smoothness
di: Godeme, Jean-Jacques
Pubblicazione: (2025)

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

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

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