Global convergence of line search method for nonsmooth optimization
From MaRDI portal
Publication:5483069
Recommendations
- scientific article; zbMATH DE number 2143965
- scientific article; zbMATH DE number 1180444
- A nonmonotone line search algorithm for nonsmooth discrete minimax problem
- Minimization of Locally Lipschitzian Functions
- A successive quadratic programming method for a class of nonsmooth optimization problems and its global convergence
Cited in
(12)- Minimization of Locally Lipschitzian Functions
- Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
- scientific article; zbMATH DE number 3874967 (Why is no real title available?)
- Global and local convergence of a filter line search method for nonlinear programming
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
- Convergence of nonmonotone line search method
- A new nonmonotone line search method for nonsmooth nonconvex optimization
- A nonmonotone line search algorithm for nonsmooth discrete minimax problem
- scientific article; zbMATH DE number 5606385 (Why is no real title available?)
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Global convergence of a curvilinear search for non-convex optimization
- scientific article; zbMATH DE number 2143965 (Why is no real title available?)
This page was built for publication: Global convergence of line search method for nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483069)
