Cover Image

Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Yagishita, Shotaro
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Simple linesearch-free first-order methods for nonconvex optimization
by: Yagishita, Shotaro, et al.
Published: (2025)

Proximal gradient-type method with generalized distance and convergence analysis without global descent lemma
by: Yagishita, Shotaro, et al.
Published: (2025)

Optimal reinsurance and investment via stochastic projected gradient method based on Malliavin calculus
by: Otsuki, Yuta, et al.
Published: (2024)

Fast algorithm for sparse least trimmed squares via trimmed-regularized reformulation
by: Yagishita, Shotaro
Published: (2024)

Exact Penalization at D-Stationary Points of Cardinality- or Rank-Constrained Problem
by: Yagishita, Shotaro, et al.
Published: (2022)

Adaptive generalized conditional gradient method for multiobjective optimization
by: Gebrie, Anteneh Getachew, et al.
Published: (2024)

A convex combination based primal-dual algorithm with linesearch for general convex-concave saddle point problems
by: Chang, Xiaokai, et al.
Published: (2024)

Stochastic smoothing accelerated gradient method for general constrained nonsmooth convex composite optimization
by: Wang, Ruyu, et al.
Published: (2023)

Minimizing smooth Kurdyka-Łojasiewicz functions via generalized descent methods: Convergence rate and complexity
by: Ahookhosh, Masoud, et al.
Published: (2025)

Improved conditional gradient method for the generalized cone order optimization problem on the local sphere
by: Zhou, Li-wen, et al.
Published: (2024)

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

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
by: Lan, Guanghui, et al.
Published: (2024)

A linesearch-based derivative-free method for noisy black-box problems
by: De Santis, Alberto, et al.
Published: (2025)

A geometric integration approach to smooth optimisation: Foundations of the discrete gradient method
by: Ehrhardt, Matthias J., et al.
Published: (2018)

Convergence of the momentum method for semialgebraic functions with locally Lipschitz gradients
by: Josz, Cédric, et al.
Published: (2023)

Non-smooth stochastic gradient descent using smoothing functions
by: Giovannelli, Tommaso, et al.
Published: (2025)

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

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

Bilevel gradient methods and the Morse parametric qualification condition
by: Bolte, Jérôme, et al.
Published: (2025)

Riemannian conditional gradient methods for composite optimization problems
by: Chen, Kangming, et al.
Published: (2024)

An inexact golden ratio primal-dual algorithm with linesearch step for a saddle point problem
by: Fang, Changjie, et al.
Published: (2024)

On the convergence of conditional gradient method for unbounded multiobjective optimization problems
by: Chen, Wang, et al.
Published: (2024)

A single-loop proximal-conditional-gradient penalty method
by: Zhang, Hao, et al.
Published: (2024)

Convergence rates of regularized quasi-Newton methods without strong convexity
by: Wang, Shida, et al.
Published: (2025)

The stochastic Ravine accelerated gradient method with general extrapolation coefficients
by: Attouch, Hedy, et al.
Published: (2024)

Generalized conditional gradient methods for multiobjective composite optimization problems with H{ö}lder condition
by: Chen, Wang, et al.
Published: (2024)

Primal-dual proximal bundle and conditional gradient methods for convex problems
by: Liang, Jiaming
Published: (2024)

Worst case complexity bounds for linesearch-type derivative-free algorithms
by: Brilli, Andrea, et al.
Published: (2023)

A semi-smooth Newton method for the nonlinear conic problem with generalized simplicial cones
by: Armijo, Nicolas F., et al.
Published: (2026)

Convergence analysis of nonmonotone proximal gradient methods under local Lipschitz continuity and Kurdyka--Łojasiewicz property
by: Jia, Xiaoxi, et al.
Published: (2024)

On rates of convergence for sample average approximations without smoothness
by: Nguyen, Hien Duy, et al.
Published: (2026)

Convergence of a particle method for gradient flows on the $L^p$-Wasserstein space
by: Lei, Rong
Published: (2025)

Cutting plane methods with gradient-based heuristics
by: Bùi, Hòa T., et al.
Published: (2025)

Gap-gradient methods for solving generalized mixed integer inverse optimization: an application to political gerrymandering
by: Smith, Ari J., et al.
Published: (2024)

Proximal gradient descent on the smoothed duality gap to solve saddle point problems
by: Fercoq, Olivier
Published: (2025)

Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers
by: Lan, Guanghui, et al.
Published: (2024)

Escaping saddle points without Lipschitz smoothness: the power of nonlinear preconditioning
by: Bodard, Alexander, et al.
Published: (2025)

Coordinate descent methods beyond smoothness and separability
by: Chorobura, Flavia, et al.
Published: (2024)

Convergence analysis of a regularized Newton method with generalized regularization terms for convex optimization problems
by: Yamakawa, Yuya, et al.
Published: (2024)

Convergence of stochastic gradient descent under a local Lojasiewicz condition for deep neural networks
by: An, Jing, et al.
Published: (2023)