Globally convergent cutting plane method for nonconvex nonsmooth minimization (Q535081)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5886730
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Globally convergent cutting plane method for nonconvex nonsmooth minimization |
scientific article; zbMATH DE number 5886730 |
Statements
Globally convergent cutting plane method for nonconvex nonsmooth minimization (English)
0 references
11 May 2011
0 references
The authors propose an algorithm for solving nonsmooth nonconvex unconstrained programming problems together with some convergence results. This algorithm generates a sequence of interior points of the epigraph of the objective function whose accumulation points are stationary points of the original problem, and so, in case the objective is convex, this is a global minimum of the problem. Some numerical experiments are also given.
0 references
nonsmooth nonconvex programming
0 references
traditional cutting plane method
0 references
bundle methods
0 references
feasible direction interior point methods
0 references
0 references
0 references
0.8608234524726868
0 references
0.8216695189476013
0 references
0.8165321350097656
0 references
0.809360146522522
0 references
