Cover Image

Bregman proximal gradient method for linear optimization under entropic constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Briceño-Arias, Luis M., Treust, Maël Le
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C25 and 65K05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
by: Zhang, Lu, et al.
Published: (2026)

A cut-and-project perspective for linearized Bregman iterations
by: Dai, Yu-Hong, et al.
Published: (2024)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)

Distributed gradient methods under heavy-tailed communication noise
by: Vukovic, Manojlo, et al.
Published: (2025)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)

Adaptive proximal gradient methods are universal without approximation
by: Oikonomidis, Konstantinos A., et al.
Published: (2024)

Monomial barrier functions for the box-constrained convex optimization problems
by: Fayed, Hatem
Published: (2024)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
by: Ang, Andersen, et al.
Published: (2023)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
by: Latafat, Puya, et al.
Published: (2023)

An interior proximal gradient method for nonconvex optimization
by: De Marchi, Alberto, et al.
Published: (2022)

An adaptive framework for first-order gradient methods
by: Hu, Xiaozhe, et al.
Published: (2026)

An accelerated preconditioned proximal gradient algorithm with a generalized Nesterov momentum for PET image reconstruction
by: Lin, Yizun, et al.
Published: (2024)

Extragradient method with feasible inexact projection to variational inequality problem
by: Millán, R. Díaz, et al.
Published: (2023)

Splitting Algorithms for Distributionally Robust Optimization
by: Briceño-Arias, Luis, et al.
Published: (2024)

Stochastic optimization over proximally smooth sets
by: Davis, Damek, et al.
Published: (2020)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
by: Millán, R. Díaz, et al.
Published: (2026)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)

Randomized block proximal method with locally Lipschitz continuous gradient
by: Pérez-Aros, Pedro, et al.
Published: (2025)

A distributed proximal splitting method with linesearch for locally Lipschitz gradients
by: Atenas, Felipe, et al.
Published: (2024)

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
by: He, Xin, et al.
Published: (2026)

Dynamic FISTA for Convex Composite Bi-Level Optimization
by: Merchav, Roey, et al.
Published: (2024)

The iterates of FISTA convergence even under inexact computations and stochastic gradients
by: Salzo, Saverio
Published: (2025)

Preconditioned primal-dual dynamics in convex optimization: non-ergodic convergence rates
by: Apidopoulos, Vassilis, et al.
Published: (2025)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
by: Wang, Haoning, et al.
Published: (2025)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
by: Kamijima, Tomoya, et al.
Published: (2025)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
by: Chen, Jian, et al.
Published: (2026)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
by: Meng, Kaiwen, et al.
Published: (2024)

Performance Estimation for Smooth and Strongly Convex Sets
by: Luner, Alan, et al.
Published: (2024)

On Averaging and Extrapolation for Gradient Descent
by: Luner, Alan, et al.
Published: (2024)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
by: Gu, Ran, et al.
Published: (2021)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
by: He, Jiahuan, et al.
Published: (2023)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
by: Sujanani, Arnesh, et al.
Published: (2024)

Augmented Lagrangian methods for fully convex composite optimization
by: De Marchi, Alberto, et al.
Published: (2025)

Distributed accelerated proximal conjugate gradient methods for multi-agent constrained optimization problems
by: Gebrie, Anteneh Getachew
Published: (2023)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
by: Bao, Chenglong, et al.
Published: (2023)

New gradient methods with 3 dimensional quadratic termination
by: Xie, Yixin, et al.
Published: (2026)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
by: Marumo, Naoki, et al.
Published: (2023)