On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions
From MaRDI portal
Publication:1803088
zbMATH Open0771.90091MaRDI QIDQ1803088FDOQ1803088
Authors: A. Perevozchikov 
Publication date: 29 June 1993
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Recommendations
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- Approximation and regularization of Lipschitz functions: Convergence of the gradients
- Optimality conditions for non-lipschitz generalized convex programming via clarke-rockafellar gradients
- scientific article; zbMATH DE number 151646
- scientific article; zbMATH DE number 433002
- scientific article; zbMATH DE number 4105704
- Convergence of the gradient projection method for generalized convex minimization
- scientific article; zbMATH DE number 4204136
- Publication:4489612
- scientific article; zbMATH DE number 4141808
Cited In (12)
- Title not available (Why is that?)
- Maximization of a function with Lipschitz continuous gradient
- Gradients on sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence of the gradient sampling algorithm on directionally Lipschitz functions
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- Discrete gradient as applied to the minimization of Lipschitzian functions
- Approximation and regularization of Lipschitz functions: Convergence of the gradients
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)
