scientific article; zbMATH DE number 16626
From MaRDI portal
Publication:3973313
[For the entire collection see Zbl 0722.00048.] For the nonsmooth nonconvex constrained optimization problem: minimize \(f(x)\) subject to \(x\in G\), where the objective function \(f\in R^ n\to R\) is supposed to be locally Lipschitz on \(g\), a bundle method is constructed which is a modification of Kiwiel's generalized cutting plane method. The global convergence of the given algorithm was established by Kiwiel, and some numerical results are reported in a further paper of the author.
Recommendations
- Bundle method for nonconvex nonsmooth constrained optimization
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- scientific article; zbMATH DE number 3846333
Cited in
(19)- A bundle-Newton method for nonsmooth unconstrained minimization
- Nonmonotone bundle-type scheme for convex nonsmooth minimization
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- scientific article; zbMATH DE number 1584097 (Why is no real title available?)
- Bundle method for nonconvex nonsmooth constrained optimization
- An approximate bundle method for non-convex optimization and its dual problem
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
- Redistributed bundle method for solving nonsmooth composite constrained optimization problem
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- Solving generation expansion planning problems with environmental constraints by a bundle method
- scientific article; zbMATH DE number 1092213 (Why is no real title available?)
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- Study on subproblem of bundle method for telecommunication network optimization problem
- A two-phase bundle method with bundle modification for nonsmooth constrained optimization
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- Bundle method for non-convex minimization with inexact subgradients and function values
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973313)
