Global convergence of line search method for nonsmooth optimization
From MaRDI portal
Publication:5483069
zbMATH Open1105.90362MaRDI QIDQ5483069FDOQ5483069
Authors: Houchun Zhou, Min Xi 
Publication date: 16 August 2006
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)
- Title not available (Why is that?)
- A nonmonotone line search algorithm for nonsmooth discrete minimax problem
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
- Global and local convergence of a filter line search method for nonlinear programming
- Convergence of nonmonotone line search method
- Title not available (Why is that?)
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- A new nonmonotone line search method for nonsmooth nonconvex optimization
- Minimization of Locally Lipschitzian Functions
- Global convergence of a curvilinear search for non-convex optimization
- Title not available (Why is that?)
- Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
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)
