Parameter-free proximal bundle methods with adaptive stepsizes for hybrid convex composite optimization problems
Fuente:
arXiv
Guardado en:
| Autores principales: | Monteiro, Renato D. C., Zhang, Honghao |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Proximal bundle methods for hybrid weakly convex composite optimization problems
por: Liang, Jiaming, et al.
Publicado: (2023)
por: Liang, Jiaming, et al.
Publicado: (2023)
Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
por: Guigues, Vincent, et al.
Publicado: (2024)
por: Guigues, Vincent, et al.
Publicado: (2024)
Multi-cut stochastic approximation methods for solving stochastic convex composite optimization
por: Liang, Jiaming, et al.
Publicado: (2025)
por: Liang, Jiaming, et al.
Publicado: (2025)
Complexity and numerical experiments of a new adaptive generic proximal bundle method
por: Guigues, Vincent, et al.
Publicado: (2024)
por: Guigues, Vincent, et al.
Publicado: (2024)
An accelerated proximal bundle method for convex optimization
por: Liao, Feng-Yi, et al.
Publicado: (2025)
por: Liao, Feng-Yi, et al.
Publicado: (2025)
Primal-dual proximal bundle and conditional gradient methods for convex problems
por: Liang, Jiaming
Publicado: (2024)
por: Liang, Jiaming
Publicado: (2024)
A unified framework for inexact adaptive stepsizes in the gradient methods, the conjugate gradient methods and the quasi-Newton methods for strictly convex quadratic optimization
por: Liu, Zexian
Publicado: (2026)
por: Liu, Zexian
Publicado: (2026)
An adaptive proximal safeguarded augmented Lagrangian method for nonsmooth DC problems with convex constraints
por: Kanzow, Christian, et al.
Publicado: (2025)
por: Kanzow, Christian, et al.
Publicado: (2025)
Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
por: Sujanani, Arnesh, et al.
Publicado: (2024)
por: Sujanani, Arnesh, et al.
Publicado: (2024)
Augmented Lagrangian methods for infeasible convex optimization problems and diverging proximal-point algorithms
por: Andrews, Roland, et al.
Publicado: (2025)
por: Andrews, Roland, et al.
Publicado: (2025)
Randomized gradient-free methods in convex optimization
por: Gasnikov, Alexander, et al.
Publicado: (2022)
por: Gasnikov, Alexander, et al.
Publicado: (2022)
An accelerated gradient method with adaptive restart for convex multiobjective optimization problems
por: Luo, Hao, et al.
Publicado: (2025)
por: Luo, Hao, et al.
Publicado: (2025)
SSNCVX: A primal-dual semismooth Newton method for convex composite optimization problem
por: Deng, Zhanwang, et al.
Publicado: (2025)
por: Deng, Zhanwang, et al.
Publicado: (2025)
A modified Polak-Ribiere-Polyak type conjugate gradient method with two stepsize strategies for vector optimization
por: Bai, Yushan, et al.
Publicado: (2024)
por: Bai, Yushan, et al.
Publicado: (2024)
Unifying restart accelerated gradient and proximal bundle methods
por: Liang, Jiaming
Publicado: (2025)
por: Liang, Jiaming
Publicado: (2025)
Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
por: Lan, Guanghui, et al.
Publicado: (2024)
por: Lan, Guanghui, et al.
Publicado: (2024)
Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization
por: Lan, Guanghui, et al.
Publicado: (2023)
por: Lan, Guanghui, et al.
Publicado: (2023)
An inexact variable metric proximal linearization method for composite optimization on manifolds
por: He, Hao, et al.
Publicado: (2025)
por: He, Hao, et al.
Publicado: (2025)
Efficiency of stochastic coordinate proximal gradient methods on nonseparable composite optimization
por: Necoara, I., et al.
Publicado: (2021)
por: Necoara, I., et al.
Publicado: (2021)
An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
por: Liu, Ruyu, et al.
Publicado: (2023)
por: Liu, Ruyu, et al.
Publicado: (2023)
Integral control of the proximal gradient method for unbiased sparse optimization
por: Cerone, V., et al.
Publicado: (2025)
por: Cerone, V., et al.
Publicado: (2025)
Stochastic smoothing accelerated gradient method for general constrained nonsmooth convex composite optimization
por: Wang, Ruyu, et al.
Publicado: (2023)
por: Wang, Ruyu, et al.
Publicado: (2023)
Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem
por: Liu, Juan, et al.
Publicado: (2024)
por: Liu, Juan, et al.
Publicado: (2024)
A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
por: Zhang, Taiwei, et al.
Publicado: (2023)
por: Zhang, Taiwei, et al.
Publicado: (2023)
Analytic analysis of the worst-case complexity of the gradient method with exact line search and the Polyak stepsize
por: Huang, Ya-Kui, et al.
Publicado: (2024)
por: Huang, Ya-Kui, et al.
Publicado: (2024)
Extended alternating structure-adapted proximal gradient algorithm for nonconvex nonsmooth problems
por: Gao, Ying, et al.
Publicado: (2024)
por: Gao, Ying, et al.
Publicado: (2024)
An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit
por: Upadhyaya, Manu, et al.
Publicado: (2026)
por: Upadhyaya, Manu, et al.
Publicado: (2026)
Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
por: Rotaru, Teodor, et al.
Publicado: (2024)
por: Rotaru, Teodor, et al.
Publicado: (2024)
Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
por: Pinheiro, Maria Eduarda, et al.
Publicado: (2024)
por: Pinheiro, Maria Eduarda, et al.
Publicado: (2024)
A globalized inexact semismooth Newton method for strongly convex optimal control problems
por: Wachsmuth, Daniel
Publicado: (2025)
por: Wachsmuth, Daniel
Publicado: (2025)
Convergence analysis of a regularized Newton method with generalized regularization terms for convex optimization problems
por: Yamakawa, Yuya, et al.
Publicado: (2024)
por: Yamakawa, Yuya, et al.
Publicado: (2024)
Riemannian conditional gradient methods for composite optimization problems
por: Chen, Kangming, et al.
Publicado: (2024)
por: Chen, Kangming, et al.
Publicado: (2024)
On a fixed-point continuation method for a convex optimization problem
por: Fest, Jean-Baptiste, et al.
Publicado: (2022)
por: Fest, Jean-Baptiste, et al.
Publicado: (2022)
Solving separable convex optimization problems: Faster prediction-correction framework
por: Zhang, Tao, et al.
Publicado: (2023)
por: Zhang, Tao, et al.
Publicado: (2023)
Research on the descent direction of prediction correction algorithms for pseudo-convex/convex optimization problems
por: Li, Ting, et al.
Publicado: (2025)
por: Li, Ting, et al.
Publicado: (2025)
Exploiting higher-order derivatives in convex optimization methods
por: Kamzolov, Dmitry, et al.
Publicado: (2022)
por: Kamzolov, Dmitry, et al.
Publicado: (2022)
Non-convex optimization problems for maximum hands-off control
por: Ikeda, Takuya
Publicado: (2024)
por: Ikeda, Takuya
Publicado: (2024)
A multilevel proximal trust-region method for nonsmooth optimization with applications
por: Baraldi, Robert, et al.
Publicado: (2025)
por: Baraldi, Robert, et al.
Publicado: (2025)
The robust isolated calmness of spectral norm regularized convex matrix optimization problems
por: Yin, Ziran, et al.
Publicado: (2024)
por: Yin, Ziran, et al.
Publicado: (2024)
Solution uniqueness of convex optimization problems via the radial cone
por: Fadili, Jalal, et al.
Publicado: (2024)
por: Fadili, Jalal, et al.
Publicado: (2024)
Ejemplares similares
-
Proximal bundle methods for hybrid weakly convex composite optimization problems
por: Liang, Jiaming, et al.
Publicado: (2023) -
Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
por: Guigues, Vincent, et al.
Publicado: (2024) -
Multi-cut stochastic approximation methods for solving stochastic convex composite optimization
por: Liang, Jiaming, et al.
Publicado: (2025) -
Complexity and numerical experiments of a new adaptive generic proximal bundle method
por: Guigues, Vincent, et al.
Publicado: (2024) -
An accelerated proximal bundle method for convex optimization
por: Liao, Feng-Yi, et al.
Publicado: (2025)