:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Ushiyama, Kansei
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control
Accès en ligne:	https://arxiv.org/abs/2509.09295
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Essential Convergence Rates of Continuous-Time Models for Optimization Methods
par: Ushiyama, Kansei, et autres
Publié: (2025)

Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
par: Guigues, Vincent, et autres
Publié: (2024)

Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem
par: Liu, Juan, et autres
Publié: (2024)

A globalized inexact semismooth Newton method for strongly convex optimal control problems
par: Wachsmuth, Daniel
Publié: (2025)

Stochastic ISTA/FISTA Adaptive Step Search Algorithms for Convex Composite Optimization
par: Nguyen, Lam M., et autres
Publié: (2024)

Curvature accelerated decentralized non-convex optimization for high-dimensional machine learning problems
par: Yi, Dingran, et autres
Publié: (2025)

IML FISTA: A Multilevel Framework for Inexact and Inertial Forward-Backward. Application to Image Restoration
par: Lauga, Guillaume, et autres
Publié: (2023)

An accelerated proximal bundle method for convex optimization
par: Liao, Feng-Yi, et autres
Publié: (2025)

An accelerated gradient method with adaptive restart for convex multiobjective optimization problems
par: Luo, Hao, et autres
Publié: (2025)

Strong Convergence of FISTA Iterates under H{ö}lderian and Quadratic Growth Conditions
par: Aujol, Jean-François, et autres
Publié: (2024)

Stochastic smoothing accelerated gradient method for general constrained nonsmooth convex composite optimization
par: Wang, Ruyu, et autres
Publié: (2023)

The Method of Ellipcenters for strongly convex minimization
par: Behling, Roger, et autres
Publié: (2026)

Linear convergence of forward-backward accelerated algorithms without knowledge of the modulus of strong convexity
par: Li, Bowen, et autres
Publié: (2023)

An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit
par: Upadhyaya, Manu, et autres
Publié: (2026)

Proximal bundle methods for hybrid weakly convex composite optimization problems
par: Liang, Jiaming, et autres
Publié: (2023)

SSNCVX: A primal-dual semismooth Newton method for convex composite optimization problem
par: Deng, Zhanwang, et autres
Publié: (2025)

Dynamic FISTA for Convex Composite Bi-Level Optimization
par: Merchav, Roey, et autres
Publié: (2024)

Study of the behaviour of Nesterov Accelerated Gradient in a non convex setting: the strongly quasar convex case
par: Hermant, Julien, et autres
Publié: (2024)

Nesterov acceleration in benignly non-convex landscapes
par: Gupta, Kanan, et autres
Publié: (2024)

Nesterov acceleration for strongly convex-strongly concave bilinear saddle point problems: discrete and continuous-time approaches
par: He, Xin, et autres
Publié: (2025)

Convergence rates of regularized quasi-Newton methods without strong convexity
par: Wang, Shida, et autres
Publié: (2025)

Parameter-free proximal bundle methods with adaptive stepsizes for hybrid convex composite optimization problems
par: Monteiro, Renato D. C., et autres
Publié: (2024)

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

Research on the descent direction of prediction correction algorithms for pseudo-convex/convex optimization problems
par: Li, Ting, et autres
Publié: (2025)

A primal-dual splitting algorithm with convex combination and larger step sizes for composite monotone inclusion problems
par: Chang, Xiaokai, et autres
Publié: (2025)

Dualities for non-Euclidean smoothness and strong convexity under the light of generalized conjugacy
par: Laude, Emanuel, et autres
Publié: (2021)

A convex combination based primal-dual algorithm with linesearch for general convex-concave saddle point problems
par: Chang, Xiaokai, et autres
Publié: (2024)

Non-convex optimization problems for maximum hands-off control
par: Ikeda, Takuya
Publié: (2024)

Hidden convexity property of a speed planning problem
par: Ardizzoni, Stefano, et autres
Publié: (2025)

Analysis of Decentralized Stochastic Successive Convex Approximation for composite non-convex problems
par: Idrees, Basil M., et autres
Publié: (2024)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
par: Sujanani, Arnesh, et autres
Publié: (2024)

Code generation for solving and differentiating through convex optimization problems
par: Schaller, Maximilian, et autres
Publié: (2025)

Random minibatch subgradient algorithms for convex problems with functional constraints
par: Nedich, Angelia, et autres
Publié: (2019)

Solution uniqueness of convex optimization problems via the radial cone
par: Fadili, Jalal, et autres
Publié: (2024)

On quasi-convex smooth optimization problems by a comparison oracle
par: Gasnikov, A. V., et autres
Publié: (2024)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
par: Guigues, Vincent, et autres
Publié: (2017)

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

Approximation analysis for the minimization problem of difference-of-convex functions with Moreau envelopes
par: Tang, Yan, et autres
Publié: (2024)

Primal-dual proximal bundle and conditional gradient methods for convex problems
par: Liang, Jiaming
Publié: (2024)