On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions

From MaRDI portal





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.











This page was built for publication: On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803088)