Curvilinear path steplength algorithms for minimization which use directions of negative curvature

DOI10.1007/BF01588294zbMath0428.90068MaRDI QIDQ3865866

Donald Goldfarb

Publication date: 1980

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

gradient methods; unconstrained minimization; negative curvature; line search; step-size procedures

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

90C52: Methods of reduced gradient type

Related Items

A restricted trust region algorithm for unconstrained optimization, A modified Newton's method for minimizing factorable functions, On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds, Modifications of the Wolfe line search rules to satisfy second-order optimality conditions in unconstrained optimization, On a second order parallel variable transformation approach., Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, An unconstrained optimization method using nonmonotone second order Goldstein's line search, Nonconvex optimization using negative curvature within a modified linesearch, A curvilinear search algorithm for unconstrained optimization by automatic differentiation, Zwei trajektorienverfahren zur Lösung nichtlinearer optimierungsaufgaben, Curved search methods for unconstrained optimization, On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem, Minimization methods for functions on simple sets

Cites Work

• Unnamed Item
• Unnamed Item
• A Newton-type curvilinear search method for optimization
• A modified Newton method for minimization
• Minimization of functions having Lipschitz continuous first partial derivatives
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
• A modification of Armijo's step-size rule for negative curvature
• On the use of directions of negative curvature in a modified newton method
• Unconstrained Optimization by Approximation of the Gradient Path
• Maximization by Quadratic Hill-Climbing
• On Steepest Descent