:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Ushiyama, Kansei
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2509.09295
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Lyapunov analysis for FISTA under strong convexity
by: Briceño-Arias, Luis M.
Published: (2025)

Essential Convergence Rates of Continuous-Time Models for Optimization Methods
by: Ushiyama, Kansei, et al.
Published: (2025)

Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
by: Guigues, Vincent, et al.
Published: (2024)

Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem
by: Liu, Juan, et al.
Published: (2024)

A globalized inexact semismooth Newton method for strongly convex optimal control problems
by: Wachsmuth, Daniel
Published: (2025)

Stochastic ISTA/FISTA Adaptive Step Search Algorithms for Convex Composite Optimization
by: Nguyen, Lam M., et al.
Published: (2024)

Curvature accelerated decentralized non-convex optimization for high-dimensional machine learning problems
by: Yi, Dingran, et al.
Published: (2025)

IML FISTA: A Multilevel Framework for Inexact and Inertial Forward-Backward. Application to Image Restoration
by: Lauga, Guillaume, et al.
Published: (2023)

An accelerated proximal bundle method for convex optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

An accelerated gradient method with adaptive restart for convex multiobjective optimization problems
by: Luo, Hao, et al.
Published: (2025)

Strong Convergence of FISTA Iterates under H{ö}lderian and Quadratic Growth Conditions
by: Aujol, Jean-François, et al.
Published: (2024)

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

The Method of Ellipcenters for strongly convex minimization
by: Behling, Roger, et al.
Published: (2026)

Linear convergence of forward-backward accelerated algorithms without knowledge of the modulus of strong convexity
by: Li, Bowen, et al.
Published: (2023)

An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit
by: Upadhyaya, Manu, et al.
Published: (2026)

Proximal bundle methods for hybrid weakly convex composite optimization problems
by: Liang, Jiaming, et al.
Published: (2023)

SSNCVX: A primal-dual semismooth Newton method for convex composite optimization problem
by: Deng, Zhanwang, et al.
Published: (2025)

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

Study of the behaviour of Nesterov Accelerated Gradient in a non convex setting: the strongly quasar convex case
by: Hermant, Julien, et al.
Published: (2024)

Nesterov acceleration in benignly non-convex landscapes
by: Gupta, Kanan, et al.
Published: (2024)

Nesterov acceleration for strongly convex-strongly concave bilinear saddle point problems: discrete and continuous-time approaches
by: He, Xin, et al.
Published: (2025)

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

Parameter-free proximal bundle methods with adaptive stepsizes for hybrid convex composite optimization problems
by: Monteiro, Renato D. C., et al.
Published: (2024)

Polyak-Łojasiewicz inequality is essentially no more general than strong convexity for $C^2$ functions
by: Nejma, Aziz Ben
Published: (2025)

Research on the descent direction of prediction correction algorithms for pseudo-convex/convex optimization problems
by: Li, Ting, et al.
Published: (2025)

A primal-dual splitting algorithm with convex combination and larger step sizes for composite monotone inclusion problems
by: Chang, Xiaokai, et al.
Published: (2025)

Dualities for non-Euclidean smoothness and strong convexity under the light of generalized conjugacy
by: Laude, Emanuel, et al.
Published: (2021)

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

Non-convex optimization problems for maximum hands-off control
by: Ikeda, Takuya
Published: (2024)

Hidden convexity property of a speed planning problem
by: Ardizzoni, Stefano, et al.
Published: (2025)

Analysis of Decentralized Stochastic Successive Convex Approximation for composite non-convex problems
by: Idrees, Basil M., et al.
Published: (2024)

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

Code generation for solving and differentiating through convex optimization problems
by: Schaller, Maximilian, et al.
Published: (2025)

Random minibatch subgradient algorithms for convex problems with functional constraints
by: Nedich, Angelia, et al.
Published: (2019)

Solution uniqueness of convex optimization problems via the radial cone
by: Fadili, Jalal, et al.
Published: (2024)

On quasi-convex smooth optimization problems by a comparison oracle
by: Gasnikov, A. V., et al.
Published: (2024)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
by: Guigues, Vincent, et al.
Published: (2017)

Nesterov acceleration for the Wasserstein minimization of displacement-convex free energies
by: Monmarché, Pierre
Published: (2026)

Approximation analysis for the minimization problem of difference-of-convex functions with Moreau envelopes
by: Tang, Yan, et al.
Published: (2024)

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