New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
From MaRDI portal
Publication:6093975
Recommendations
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
- A proximal bundle method with inexact data for convex nondifferentiable minimization
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
Cites work
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A new trust region method for nonsmooth nonconvex optimization
- A proximal bundle algorithm for nonsmooth optimization on Riemannian manifolds
- A proximal bundle method based on approximate subgradients
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- A redistributed proximal bundle method for nonconvex optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A trust region algorithm for minimization of locally Lipschitzian functions
- Aggregate subgradient method for nonsmooth DC optimization
- An augmented subgradient method for minimizing nonsmooth DC functions
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- 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
- Benchmarking optimization software with performance profiles.
- Bundle method for non-convex minimization with inexact subgradients and function values
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Continuous subdifferential approximations and their applications
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Cutting plane oracles to minimize non-smooth non-convex functions
- Efficiency of proximal bundle methods
- Error stability properties of generalized gradient-type algorithms
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3619635 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Introduction to nonsmooth optimization. Theory, practice and software
- Nonsmooth optimization via quasi-Newton methods
- Primal-dual subgradient methods for convex problems
- Subgradient method for nonconvex nonsmooth optimization
Cited in
(6)- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm
- A dynamic multiple proximal bundle algorithm for locally Lipschitz multiobjective optimization problems
- Bundle trust region algorithm based on linear subproblem
- A proximal bundle technique for solving the equilibrium problems with inexact oracles
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6093975)
