:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Fujiki, Kiwamu, Takahashi, Shota, Takeda, Akiko
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2510.06615
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization
by: Takahashi, Shota, et al.
Published: (2023)

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

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

Delay-tolerant distributed Bregman proximal algorithms
by: Chraibi, S., et al.
Published: (2024)

Modified Armijo line search in optimization on Riemannian submanifolds with reduced computational cost
by: Sato, Hiroyuki, et al.
Published: (2023)

Random-Subspace Frank--Wolfe over Strongly Convex Sets
by: Poirion, Pierre-Louis, et al.
Published: (2026)

Block-coordinate Plug-And-Play Methods with Armijo-like line-search for Image Restoration
by: Porta, Federica, et al.
Published: (2026)

Projection onto hyperbolicity cones and beyond: a dual Frank-Wolfe approach
by: Nagano, Takayuki, et al.
Published: (2024)

Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search
by: Jin, Qiujiang, et al.
Published: (2024)

Complexities of Armijo-like algorithms in Deep Learning context
by: Bilel, Bensaid
Published: (2024)

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

Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
by: Nishijima, Mitsuhiro, et al.
Published: (2025)

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

Subspace Quasi-Newton Method with Gradient Approximation
by: Miyaishi, Taisei, et al.
Published: (2024)

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

Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster
by: Vaswani, Sharan, et al.
Published: (2025)

A nonmonotone extrapolated proximal gradient-subgradient algorithm beyond global Lipschitz gradient continuity
by: Yang, Lei, et al.
Published: (2025)

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

Douglas--Rachford algorithm for nonmonotone multioperator inclusion problems
by: Alcantara, Jan Harold, et al.
Published: (2025)

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

Conjugate gradient methods without line search for multiobjective optimization
by: Chen, Wang, et al.
Published: (2023)

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

Theoretical smoothing frameworks for nonsmooth simple bilevel problems
by: Alcantara, Jan Harold, et al.
Published: (2024)

Computing local minimizers in polynomial optimization under genericity conditions
by: Hieu, Vu Trung, et al.
Published: (2023)

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

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

Parameter-free accelerated gradient descent for nonconvex minimization
by: Marumo, Naoki, et al.
Published: (2022)

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

Adaptive Conditional Gradient Sliding: Projection-Free and Line-Search-Free Acceleration
by: Takahashi, Shota
Published: (2026)

A primal-dual interior point trust region method for second-order stationary points of Riemannian inequality-constrained optimization problems
by: Obara, Mitsuaki, et al.
Published: (2025)

Local near-quadratic convergence of Riemannian interior point methods
by: Obara, Mitsuaki, et al.
Published: (2025)

A Simple yet Highly Accurate Prediction-Correction Algorithm for Time-Varying Optimization
by: Kamijima, Tomoya, et al.
Published: (2025)

Frank-Wolfe algorithm for star-convex functions
by: Millan, R. Diaz, et al.
Published: (2025)

The latent variable proximal point algorithm for variational problems with inequality constraints
by: Dokken, Jørgen S., et al.
Published: (2025)

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

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

Theoretical analysis of the randomized subspace regularized Newton method for non-convex optimization
by: Fuji, Terunari, et al.
Published: (2022)

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

Analytic analysis of the worst-case complexity of the gradient method with exact line search and the Polyak stepsize
by: Huang, Ya-Kui, et al.
Published: (2024)

A stochastic gradient descent algorithm with random search directions
by: Gbaguidi, Eméric
Published: (2025)