Copertina

Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Guigues, Vincent, Liang, Jiaming, Monteiro, Renato D. C.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

Complexity and numerical experiments of a new adaptive generic proximal bundle method
di: Guigues, Vincent, et al.
Pubblicazione: (2024)

Multi-cut stochastic approximation methods for solving stochastic convex composite optimization
di: Liang, Jiaming, et al.
Pubblicazione: (2025)

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

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

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

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

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

Unifying restart accelerated gradient and proximal bundle methods
di: Liang, Jiaming
Pubblicazione: (2025)

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

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

Computing AD-compatible subgradients of convex relaxations of implicit functions
di: Song, Yingkai, et al.
Pubblicazione: (2025)

A proximal subgradient algorithm for constrained multiobjective DC-type optimization
di: Van Tuyen, Nguyen, et al.
Pubblicazione: (2025)

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

Stochastic subgradient for composite optimization with functional constraints
di: Necoara, Ion, et al.
Pubblicazione: (2022)

Augmented Lagrangian methods for infeasible convex optimization problems and diverging proximal-point algorithms
di: Andrews, Roland, et al.
Pubblicazione: (2025)

Randomized gradient-free methods in convex optimization
di: Gasnikov, Alexander, et al.
Pubblicazione: (2022)

Stochastic and incremental subgradient methods for convex optimization on Hadamard spaces
di: Goodwin, Ariel, et al.
Pubblicazione: (2024)

Introducing the method of ellipcenters, a new first order technique for unconstrained optimization
di: Behling, Roger, et al.
Pubblicazione: (2025)

Exploiting higher-order derivatives in convex optimization methods
di: Kamzolov, Dmitry, et al.
Pubblicazione: (2022)

An adaptive proximal safeguarded augmented Lagrangian method for nonsmooth DC problems with convex constraints
di: Kanzow, Christian, et al.
Pubblicazione: (2025)

Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
di: Pinheiro, Maria Eduarda, et al.
Pubblicazione: (2024)

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

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

Hypodifferentials of nonsmooth convex functions and their applications to nonsmooth convex optimization
di: Dolgopolik, M. V.
Pubblicazione: (2023)

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

A $\sqrt{2}$-accelerated FISTA for composite strongly convex problems
di: Ushiyama, Kansei
Pubblicazione: (2025)

Stochastic Quadratic Dynamic Programming
di: Guigues, Vincent, et al.
Pubblicazione: (2025)

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

Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints
di: Singh, Nitesh Kumar, et al.
Pubblicazione: (2024)

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

Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods
di: Liao, Feng-Yi, et al.
Pubblicazione: (2023)

An SDE perspective on stochastic convex optimization
di: Maulen-Soto, Rodrigo, et al.
Pubblicazione: (2022)

Strong duality in infinite convex optimization
di: Hantoute, Abderrahim, et al.
Pubblicazione: (2025)

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

On the convergence of proximal gradient methods for convex simple bilevel optimization
di: Latafat, Puya, et al.
Pubblicazione: (2023)

A proximal algorithm incorporating difference of convex functions optimization for solving a class of single-ratio fractional programming
di: Qi, Anna, et al.
Pubblicazione: (2025)

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

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