Image de couverture de livre

Approximate Bregman proximal gradient algorithm with variable metric Armijo--Wolfe line search

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fujiki, Kiwamu, Takahashi, Shota, Takeda, Akiko
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization
par: Takahashi, Shota, et autres
Publié: (2023)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
par: Takahashi, Shota, et autres
Publié: (2025)

Majorization-minimization Bregman proximal gradient algorithms for NMF with the Kullback--Leibler divergence
par: Takahashi, Shota, et autres
Publié: (2024)

Delay-tolerant distributed Bregman proximal algorithms
par: Chraibi, S., et autres
Publié: (2024)

Modified Armijo line search in optimization on Riemannian submanifolds with reduced computational cost
par: Sato, Hiroyuki, et autres
Publié: (2023)

Block-coordinate Plug-And-Play Methods with Armijo-like line-search for Image Restoration
par: Porta, Federica, et autres
Publié: (2026)

Random-Subspace Frank--Wolfe over Strongly Convex Sets
par: Poirion, Pierre-Louis, et autres
Publié: (2026)

Projection onto hyperbolicity cones and beyond: a dual Frank-Wolfe approach
par: Nagano, Takayuki, et autres
Publié: (2024)

Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search
par: Jin, Qiujiang, et autres
Publié: (2024)

Complexities of Armijo-like algorithms in Deep Learning context
par: Bilel, Bensaid
Publié: (2024)

Inexact JKO and proximal-gradient algorithms in the Wasserstein space
par: Di Marino, Simone, et autres
Publié: (2025)

Projected proximal gradient trust-region algorithm for nonsmooth optimization
par: Dao, Minh N., et autres
Publié: (2025)

Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
par: Nishijima, Mitsuhiro, et autres
Publié: (2025)

Subspace Quasi-Newton Method with Gradient Approximation
par: Miyaishi, Taisei, et autres
Publié: (2024)

Bregman proximal gradient method for linear optimization under entropic constraints
par: Briceño-Arias, Luis M., et autres
Publié: (2025)

A nonmonotone extrapolated proximal gradient-subgradient algorithm beyond global Lipschitz gradient continuity
par: Yang, Lei, et autres
Publié: (2025)

An inexact variable metric proximal linearization method for composite optimization on manifolds
par: He, Hao, et autres
Publié: (2025)

Extended alternating structure-adapted proximal gradient algorithm for nonconvex nonsmooth problems
par: Gao, Ying, et autres
Publié: (2024)

Conjugate gradient methods without line search for multiobjective optimization
par: Chen, Wang, et autres
Publié: (2023)

Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster
par: Vaswani, Sharan, et autres
Publié: (2025)

Efficient sparse probability measures recovery via Bregman gradient
par: Pan, Jianting, et autres
Publié: (2024)

An equivalent reformulation and multi-proximity gradient algorithms for a class of nonsmooth fractional programming
par: Zhou, Junpeng, et autres
Publié: (2023)

A Bregman firmly nonexpansive proximal operator for baryconvex optimization
par: Achab, Mastane
Publié: (2024)

Adaptive Conditional Gradient Sliding: Projection-Free and Line-Search-Free Acceleration
par: Takahashi, Shota
Publié: (2026)

On the complexity of proximal gradient and proximal gradient-Newton-CG methods for \(\ell_1\)-regularized Optimization
par: Zhu, Hong
Publié: (2025)

Theoretical smoothing frameworks for nonsmooth simple bilevel problems
par: Alcantara, Jan Harold, et autres
Publié: (2024)

Computing local minimizers in polynomial optimization under genericity conditions
par: Hieu, Vu Trung, et autres
Publié: (2023)

Douglas--Rachford algorithm for nonmonotone multioperator inclusion problems
par: Alcantara, Jan Harold, et autres
Publié: (2025)

Frank-Wolfe algorithm for star-convex functions
par: Millan, R. Diaz, et autres
Publié: (2025)

A primal-dual interior point trust region method for second-order stationary points of Riemannian inequality-constrained optimization problems
par: Obara, Mitsuaki, et autres
Publié: (2025)

Local near-quadratic convergence of Riemannian interior point methods
par: Obara, Mitsuaki, et autres
Publié: (2025)

A Simple yet Highly Accurate Prediction-Correction Algorithm for Time-Varying Optimization
par: Kamijima, Tomoya, et autres
Publié: (2025)

Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems
par: Savchuk, O. S., et autres
Publié: (2024)

Analytic analysis of the worst-case complexity of the gradient method with exact line search and the Polyak stepsize
par: Huang, Ya-Kui, et autres
Publié: (2024)

An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
par: Maleknia, Morteza, et autres
Publié: (2024)

An inexact Bregman proximal point method and its acceleration version for unbalanced optimal transport
par: Chen, Xiang, et autres
Publié: (2024)

The latent variable proximal point algorithm for variational problems with inequality constraints
par: Dokken, Jørgen S., et autres
Publié: (2025)

Parameter-free accelerated gradient descent for nonconvex minimization
par: Marumo, Naoki, et autres
Publié: (2022)

Unifying restart accelerated gradient and proximal bundle methods
par: Liang, Jiaming
Publié: (2025)

Variable Bregman Majorization-Minimization algorithms for nonconvex nonsmooth optimization, with application to Poisson imaging
par: Adly, Maxence, et autres
Publié: (2026)