Differential optimization techniques

DOI10.1016/0307-904X(84)90048-9MaRDI QIDQ761355zbMATH OpenFDO

Authors D. J. Van Wyk

Publication date 1984

Published in Applied Mathematical Modelling (Search for Journal in Brave)

zbMATH Keywords

differential systemsunconstrained minimizationdynamic gradient methodSnyman's dynamic method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)

Recommendations

• UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS
• scientific article; zbMATH DE number 704195
• Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
• scientific article; zbMATH DE number 465313
• scientific article; zbMATH DE number 88930

Cites work

• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A Family of Gradient Methods for Optimization
• A New Method for Solving Nonlinear Simultaneous Equations
• A class of differential descent methods for constrained optimization
• A new and dynamic method for unconstrained minimization
• A new arc algorithm for unconstrained optimization
• Algorithms Supplement
• An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
• Optimally conditioned optimization algorithms without line searches
• Quadratic termination properties of Davidon's new variable metric algorithm
• The Solution of Nonlinear Systems of Equations by Second Order Systems of O.D.E. and Linearly Implicit A-Stable Techniques
• Unconstrained Optimization by Approximation of the Gradient Path

Cited in

(11)

• On memory gradient method with trust region for unconstrained optimization
• A modified nonmonotone BFGS algorithm for unconstrained optimization
• A new super-memory gradient method with curve search rule
• A new descent algorithm with curve search rule
• An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
• Non monotone backtracking inexact BFGS method for regression analysis
• Global convergence of a modified Broyden family method for nonconvex functions
• Optimization technique for some partial differential equations
• New line search methods for unconstrained optimization
• scientific article; zbMATH DE number 2143180 (Why is no real title available?)
• Convergence analysis of a modified BFGS method on convex minimizations

This page was built for publication: Differential optimization techniques

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