Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
From MaRDI portal
Publication:848722
DOI10.1007/s10957-009-9584-6zbMath1183.90389OpenAlexW2046063090MaRDI QIDQ848722
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
Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Optimization of upper semidifferentiable functions
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- A Cholesky dual method for proximal piecewise linear programming
- Methods of descent for nondifferentiable optimization
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Optimization and nonsmooth analysis
- Optimization of lipschitz continuous functions
- An introduction to the theory of nonsmooth optimization
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization