A conjugate direction gradient method with reconnaissance steps for unconstrained minimization
From MaRDI portal
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; zbMATH DE number 4166732
Cites work
Cited in
(11)- A convergent dynamic method for large minimization problems
- scientific article; zbMATH DE number 494369 (Why is no real title available?)
- Spline and weighted random directions method for nonlinear optimization
- scientific article; zbMATH DE number 3961356 (Why is no real title available?)
- A statistic method for the computation of the conjugate directions
- scientific article; zbMATH DE number 3952511 (Why is no real title available?)
- UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS
- A direct search conjugate directions algorithm for unconstrained minimization
- The conjugate gradient method for unconstrained minimization
- scientific article; zbMATH DE number 3978844 (Why is no real title available?)
- 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)