pith. sign in

arxiv: 1310.2714 · v1 · pith:QDQ5DW3Inew · submitted 2013-10-10 · 🧮 math.OC

Nonsmooth Steepest Descent Method by Proximal Subdifferentials in Hilbert Spaces

classification 🧮 math.OC
keywords functionsalgorithmnonsmoothconvexdescenthilbertmethodproximal
0
0 comments X
read the original abstract

In this paper, we first study nonsmooth steepest descent method for nonsmooth functions defined on Hilbert space and establish the corresponding algorithm by proximal subgradients. Then, we use this algorithm to find stationary points for those functions satisfying prox-regularity and Lipschitzian continuity. As one application, the established algorithm is used to search the minimizer of lower semicontinuous and convex functions on finite-dimensional space. The convergent theorem, as one extension and improvement of the existing converging result for twice continuously differentiable convex functions, is also presented therein.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.