An approximate bundle method for non-convex optimization and its dual problem
From MaRDI portal
Recommendations
- Bundle method for nonconvex nonsmooth constrained optimization
- An implementable bundle method for nonsmooth convex optimization
- A doubly stabilized bundle method for nonsmooth convex optimization
- scientific article; zbMATH DE number 16626
- A hybrid bundle method for nonsmooth convex optimization
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
- An approximate bundle method for solving nonsmooth equilibrium problems
- scientific article; zbMATH DE number 3846333
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
Cited in
(6)- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- A study on the dual problem of nonsmooth bundle method based on approximate subgradients
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
This page was built for publication: An approximate bundle method for non-convex optimization and its dual problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2823697)