Differential optimization techniques
From MaRDI portal
Publication:761355
DOI10.1016/0307-904X(84)90048-9zbMATH Open0555.90092MaRDI QIDQ761355FDOQ761355
Authors: D. J. Van Wyk
Publication date: 1984
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
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
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)
Cites Work
- Title not available (Why is that?)
- A new and dynamic method for unconstrained minimization
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- Optimally conditioned optimization algorithms without line searches
- A New Method for Solving Nonlinear Simultaneous Equations
- A new arc algorithm for unconstrained optimization
- Unconstrained Optimization by Approximation of the Gradient Path
- A class of differential descent methods for constrained optimization
- The Solution of Nonlinear Systems of Equations by Second Order Systems of O.D.E. and Linearly Implicit A-Stable Techniques
- Algorithms Supplement
- Quadratic termination properties of Davidon's new variable metric algorithm
- A Family of Gradient Methods for Optimization
Cited In (11)
- Title not available (Why is that?)
- A new super-memory gradient method with curve search rule
- Convergence analysis of a modified BFGS method on convex minimizations
- New line search methods for unconstrained optimization
- A new descent algorithm with curve search rule
- Global convergence of a modified Broyden family method for nonconvex functions
- Optimization technique for some partial differential equations
- Non monotone backtracking inexact BFGS method for regression analysis
- On memory gradient method with trust region for unconstrained optimization
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
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)