A conjugate direction gradient method with reconnaissance steps for unconstrained minimization
DOI10.1016/0898-1221(88)90009-0zbMATH Open0661.65062OpenAlexW2078635075MaRDI QIDQ1113622FDOQ1113622
Authors: S. H. Smith
Publication date: 1988
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(88)90009-0
Recommendations
- A direct search conjugate directions algorithm for unconstrained minimization
- scientific article; zbMATH DE number 3952511
- UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS
- A fast and robust unconstrained optimization method requiring minimum storage
- scientific article
global convergenceunconstrained minimizationFletcher-Reeves methodline searchesconjugate direction type gradient methodreconnaissance pointsRosenbrock test function
Cites Work
Cited In (11)
- UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS
- Title not available (Why is that?)
- A convergent dynamic method for large minimization problems
- A statistic method for the computation of the conjugate directions
- A direct search conjugate directions algorithm for unconstrained minimization
- The conjugate gradient method for unconstrained minimization
- Title not available (Why is that?)
- Spline and weighted random directions method for nonlinear optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
This page was built for publication: A conjugate direction gradient method with reconnaissance steps for unconstrained minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1113622)