The conjugate gradient method for unconstrained minimization

MaRDI QIDQ2917747zbMATH OpenFDO

Authors Subir K. Sarkar

Publication date 1 October 2012

zbMATH Keywords

conjugate gradient methodDavidon-Fletcher-Powell (DFP) algorithmgeometries of the atomic arrangementsminimization of the energy functionalquasi-Newton methodssteepest descent methodunconstrained minimization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Methods of reduced gradient type (90C52)

Recommendations

• scientific article; zbMATH DE number 3843083
• A direct search conjugate directions algorithm for unconstrained minimization
• A convergent dynamic method for large minimization problems
• A conjugate direction gradient method with reconnaissance steps for unconstrained minimization
• UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS

Cited in

(5)

• A bracketing technique to ensure desirable convergence in univariate minimization
• Unconstrained energy functionals for electronic structure calculations
• On the method of shortest residuals for unconstrained optimization
• Gradient-only approaches to avoid spurious local minima in unconstrained optimization
• The Minimal Error Conjugate Gradient Method is a Regularization Method

This page was built for publication: The conjugate gradient method for unconstrained minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917747)