Convergence of the nonmonotone Perry and Shanno method for optimization
From MaRDI portal
Publication:1583585
DOI10.1023/A:1008753308646zbMATH Open0963.90047OpenAlexW73033612MaRDI QIDQ1583585FDOQ1583585
Authors: Lili Jing, Guanghui Liu 
Publication date: 26 June 2001
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008753308646
Recommendations
- Convergence of the nonmonotone Perry-Shanno method for unconstrained optimization
- scientific article; zbMATH DE number 6747349
- Globally convergent modified Perry's conjugate gradient method
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52)
Cited In (7)
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
- Shuttle iterations in problems with nonmonotone nonlinearities.
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- Title not available (Why is that?)
- Convergence of Perry and Shanno's memoryless quasi-Newton method with parameters
- A new nonmonotone line search technique for unconstrained optimization
Uses Software
This page was built for publication: Convergence of the nonmonotone Perry and Shanno method for optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583585)
