On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions (Q1803088)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions |
scientific article; zbMATH DE number 220229
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions |
scientific article; zbMATH DE number 220229 |
Statements
On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions (English)
0 references
29 June 1993
0 references
The author gives an algorithm for finding the stationary points for the minimization problem \(q(x)\to\min\), \(x\in E_ n\), where \(q: E_ n\to\mathbb{R}\) is a locally Lipschitz function. One states the convergence and stability of the algorithm, and are given estimates of its speed of convergence. A minimization problem with an inequality constraint is also studied.
0 references
stationary points
0 references
locally Lipschitz function
0 references
stability
0 references
speed of convergence
0 references
0.90918124
0 references
0.90097106
0 references
0.8999624
0 references
0.89010966
0 references