A class of methods for unconstrained minimization based on stable numerical integration techniques
Publication:1257326
DOI10.1016/0022-247X(78)90068-9zbMath0405.65041MaRDI QIDQ1257326
Publication date: 1978
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
AlgorithmsNumerical ExamplesFunction MinimizationUnconstrained MinimizationInitial Value Systems Of Nonlinear Differential EquationsNewton MethodSequence of Approximate MinimizersStable Numerical Integration TechniquesSteepest Descent
Numerical optimization and variational techniques (65K10) Numerical methods for initial value problems involving ordinary differential equations (65L05) Mathematical programming (90C99)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of differential descent methods for constrained optimization
- A Newton-type curvilinear search method for optimization
- Differential gradient methods
- A modified homogeneous algorithm for function minimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- The Feasibility of Continuation Methods for Nonlinear Equations
- A special stability problem for linear multistep methods
This page was built for publication: A class of methods for unconstrained minimization based on stable numerical integration techniques