UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS

DOI10.1080/16073606.1985.9631898zbMath0588.65044OpenAlexW2004398505MaRDI QIDQ3716226

No author found.

Publication date: 1985

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/16073606.1985.9631898

zbMATH Keywords

numerical examplesdynamic methodFletcher-Reeves conjugate gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (4)

A dynamic penalty function method for the solution of structural optimization problems ⋮ Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation method ⋮ A gradient-only line search method for the conjugate gradient method applied to constrained optimization problems with severe noise in the objective function ⋮ The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches

Uses Software

• IMSL Numerical Libraries

Cites Work

• Unnamed Item
• An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
• A new and dynamic method for unconstrained minimization

This page was built for publication: UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS