A convergent dynamic method for large minimization problems
From MaRDI portal
Publication:1124283
DOI10.1016/0898-1221(89)90020-5zbMath0678.65042MaRDI QIDQ1124283
Publication date: 1989
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(89)90020-5
convergence; comparison of methods; convex functions; equations of motion; conjugate gradient algorithm; unconstrained minimization; gradient algorithm; dynamic problem; ``leap-frog method
Related Items
An optimization technique for the falkner-skan equation, Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation method, A dynamic penalty function method for the solution of structural optimization problems, Space-decomposition minimization method for large-scale minimization problems