A convergent dynamic method for large minimization problems

DOI10.1016/0898-1221(89)90020-5zbMath0678.65042OpenAlexW2087847279MaRDI QIDQ1124283

S. H. Smith

Publication date: 1989

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(89)90020-5

zbMATH Keywords

convergencecomparison of methodsconvex functionsequations of motionconjugate gradient algorithmunconstrained minimizationgradient algorithmdynamic problem``leap-frog method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

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
• Restart procedures for the conjugate gradient method
• A New Method for Solving Nonlinear Simultaneous Equations

Related Items (8)

A dynamic penalty function method for the solution of structural optimization problems ⋮ Boundary integral method applied to the propagation of non-linear gravity waves generated by a moving bottom ⋮ Numerical treatment of solving singular integral equations by using sinc approximations ⋮ Space-decomposition minimization method for large-scale minimization problems ⋮ An optimization technique for the falkner-skan equation ⋮ Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation method ⋮ Effects of general rotation and a horizontal magnetic field on the Rayleigh-Taylor instability of three-fluid layer in porous media ⋮ An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)

This page was built for publication: A convergent dynamic method for large minimization problems