Differential optimization techniques
From MaRDI portal
The relationship of Snyman's dynamic method for unconstrained minimization [see \textit{J. A. Snyman}, ibid. 6, 449-462 (1982; Zbl 0501.65026)] with other methods based on solving differential systems, is investigated. A modification of the dynamic method to enhance convergence properties is proposed and theoretically analysed.
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
- A class of differential descent methods for constrained optimization
- A Family of Gradient Methods for Optimization
- A new and dynamic method for unconstrained minimization
- A new arc algorithm for unconstrained optimization
- A New Method for Solving Nonlinear Simultaneous Equations
- Algorithms Supplement
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- 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)- Optimization technique for some partial differential equations
- A new descent algorithm with curve search rule
- Global convergence of a modified Broyden family method for nonconvex functions
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- On memory gradient method with trust region for unconstrained optimization
- New line search methods for unconstrained optimization
- A new super-memory gradient method with curve search rule
- scientific article; zbMATH DE number 2143180 (Why is no real title available?)
- Non monotone backtracking inexact BFGS method for regression analysis
- Convergence analysis of a modified BFGS method on convex minimizations
- 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)
