A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
From MaRDI portal
Publication:5058380
DOI10.1080/10556788.2021.2023522OpenAlexW4212967432MaRDI QIDQ5058380
Morteza Maleknia, Mostafa Shamsi
Publication date: 20 December 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2021.2023522
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods based on necessary conditions (49M05) Numerical methods based on nonlinear programming (49M37)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A doubly stabilized bundle method for nonsmooth convex optimization
- Nonsmooth optimization via quasi-Newton methods
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
- Proximity control in bundle methods for convex nondifferentiable minimization
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- New variable-metric algorithms for nondifferentiable optimization problems
- On the local convergence analysis of the gradient sampling method for finite max-functions
- A fast gradient and function sampling method for finite-max functions
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- A conjugate gradient sampling method for nonsmooth optimization
- Methods of descent for nondifferentiable optimization
- Superlinearly convergent algorithm for min-max problems
- On the differentiability check in gradient sampling methods
- An adaptive gradient sampling algorithm for non-smooth optimization
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- Introduction to Nonsmooth Optimization
- An aggregate subgradient method for nonsmooth convex minimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An Efficient Method to Solve the Minimax Problem Directly
- Incremental Bundle Methods using Upper Models
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
- A self-correcting variable-metric algorithm framework for nonsmooth optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
