Cover Image

Complexity and numerical experiments of a new adaptive generic proximal bundle method

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Guigues, Vincent, Monteiro, Renato, Tran, Benoit
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Stochastic Quadratic Dynamic Programming
by: Guigues, Vincent, et al.
Published: (2025)

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

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

Unifying restart accelerated gradient and proximal bundle methods
by: Liang, Jiaming
Published: (2025)

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

Policies for the Operation of an Ambulance Fleet under Uncertainty based on a New Preparedness Metric
by: Guigues, Vincent, et al.
Published: (2026)

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

New Heuristics for the Operation of an Ambulance Fleet under Uncertainty
by: Guigues, Vincent, et al.
Published: (2024)

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

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

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

A relaxed proximal point algorithm with double-inertial effects for nonconvex equilibrium problems
by: Van Tran, Nam
Published: (2025)

On the complexity of proximal gradient and proximal gradient-Newton-CG methods for \(\ell_1\)-regularized Optimization
by: Zhu, Hong
Published: (2025)

Extended alternating structure-adapted proximal gradient algorithm for nonconvex nonsmooth problems
by: Gao, Ying, et al.
Published: (2024)

Complexity of quadratic penalty methods with adaptive accuracy under a PL condition for the constraints
by: Goyens, Florentin, et al.
Published: (2026)

Stability of Two-Stage Stochastic Programs Under Problem-Dependent Costs
by: Peyrousset, Nils, et al.
Published: (2026)

Calculus rules for proximal ε-subdifferentials and inexact proximity operators for weakly convex functions
by: Bednarczuk, Ewa, et al.
Published: (2022)

Integral control of the proximal gradient method for unbiased sparse optimization
by: Cerone, V., et al.
Published: (2025)

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

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

Weak convergence of the stochastic proximal point method in metric spaces
by: Pischke, Nicholas
Published: (2026)

An inexact variable metric proximal linearization method for composite optimization on manifolds
by: He, Hao, et al.
Published: (2025)

Efficiency of stochastic coordinate proximal gradient methods on nonseparable composite optimization
by: Necoara, I., et al.
Published: (2021)

A multilevel proximal trust-region method for nonsmooth optimization with applications
by: Baraldi, Robert, et al.
Published: (2025)

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
by: Liu, Ruyu, et al.
Published: (2023)

An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint
by: Sempere, Gregorio M., et al.
Published: (2024)

Efficient algorithms for implementing incremental proximal-point methods
by: Shtoff, Alex
Published: (2022)

Operation of an ambulance fleet under uncertainty
by: Guigues, Vincent, et al.
Published: (2022)

A consistently adaptive trust-region method
by: Hamad, Fadi, et al.
Published: (2024)

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

Group zero-norm regularized robust loss minimization: proximal MM method and statistical error bound
by: Liang, Ling, et al.
Published: (2025)

A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
by: Zhang, Taiwei, et al.
Published: (2023)

A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds
by: Tang, Chunming, et al.
Published: (2024)

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

Characterizations of inexact proximal operators
by: Lauga, Guillaume, et al.
Published: (2026)

A simple and practical adaptive trust-region method
by: Hamad, Fadi, et al.
Published: (2024)

Parallel Polyhedral Projection Method for the Convex Feasibility Problem
by: Barros, Pablo, et al.
Published: (2025)