A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
From MaRDI portal
Publication:2023656
DOI10.1007/S10589-020-00213-YzbMATH Open1462.65069arXiv1911.10546OpenAlexW3044790043MaRDI QIDQ2023656FDOQ2023656
Authors: Morteza Maleknia, M. Shamsi 
Publication date: 3 May 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Abstract: In this paper, we combine the positive aspects of the Gradient Sampling (GS) and bundle methods, as the most efficient methods in nonsmooth optimization, to develop a robust method for solving unconstrained nonsmooth convex optimization problems. The main aim of the proposed method is to take advantage of both GS and bundle methods, meanwhile avoiding their drawbacks. At each iteration of this method, to find an efficient descent direction, the GS technique is utilized for constructing a local polyhedral model for the objective function. If necessary, via an iterative improvement process, this initial polyhedral model is improved by some techniques inspired by the bundle and GS methods. The convergence of the method is studied, which reveals the following positive features (i) The convergence of our method is independent of the number of gradient evaluations required to establish and improve the initial polyhedral models. Thus, the presented method needs much fewer gradient evaluations in comparison to the original GS method. (ii) As opposed to GS type methods, the objective function need not be continuously differentiable on a full measure open set in to ensure the convergence for the class of convex problems. Apart from the mentioned advantages, by means of numerical simulations, we show that the presented method provides promising results in comparison with GS methods, especially for large scale problems. Moreover, in contrast with bundle methods, our method is not very sensitive to the accuracy of supplied gradients.
Full work available at URL: https://arxiv.org/abs/1911.10546
Recommendations
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
- An implementable bundle method for nonsmooth convex optimization
- A hybrid bundle method for nonsmooth convex optimization
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
Numerical mathematical programming methods (65K05) Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Methods of descent for nondifferentiable optimization
- An aggregate subgradient method for nonsmooth convex minimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
- Proximity control in bundle methods for convex nondifferentiable minimization
- A doubly stabilized bundle method for nonsmooth convex optimization
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Polyhedral separability through successive LP
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- Introduction to nonsmooth optimization. Theory, practice and software
- A conjugate gradient sampling method for nonsmooth optimization
- A fast gradient and function sampling method for finite-max functions
- On the differentiability check in gradient sampling methods
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- Incremental bundle methods using upper models
Cited In (3)
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
Uses Software
This page was built for publication: A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2023656)
