New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
DOI10.1007/s11075-023-01519-8zbMath1523.65050OpenAlexW4366991942MaRDI QIDQ6093975
No author found.
Publication date: 12 September 2023
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-023-01519-8
nonsmooth optimizationnonconvex optimizationproximal bundle methodinexact informationgradient sampling
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Subgradient method for nonconvex nonsmooth optimization
- Nonsmooth optimization via quasi-Newton methods
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Cutting plane oracles to minimize non-smooth non-convex functions
- Error stability properties of generalized gradient-type algorithms
- A trust region algorithm for minimization of locally Lipschitzian functions
- Continuous subdifferential approximations and their applications
- Efficiency of proximal bundle methods
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- Approximations in proximal bundle methods and decomposition of convex programs
- Aggregate subgradient method for nonsmooth DC optimization
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- An augmented subgradient method for minimizing nonsmooth DC functions
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- Introduction to Nonsmooth Optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- A new trust region method for nonsmooth nonconvex optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
- A proximal bundle algorithm for nonsmooth optimization on Riemannian manifolds
- A proximal bundle method based on approximate subgradients
- Benchmarking optimization software with performance profiles.
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
This page was built for publication: New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
