Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
DOI10.1007/S10957-009-9584-6zbMATH Open1183.90389OpenAlexW2046063090MaRDI QIDQ848722FDOQ848722
Authors: Krzysztof C. Kiwiel 
Publication date: 5 March 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://rcin.org.pl/dlibra/docmetadata?showContent=true&id=144827
Recommendations
- A quasisecant method for minimizing nonsmooth functions
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- scientific article; zbMATH DE number 4045492
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Methods of descent for nondifferentiable optimization
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Optimization of lipschitz continuous functions
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- A Cholesky dual method for proximal piecewise linear programming
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Optimization of upper semidifferentiable functions
- An introduction to the theory of nonsmooth optimization
Cited In (6)
- Title not available (Why is that?)
- A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities
- Inexact reduced gradient methods in nonconvex optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- A quasisecant method for minimizing nonsmooth functions
- A note on the convergence of deterministic gradient sampling in nonsmooth optimization
Uses Software
This page was built for publication: Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848722)
