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 methodsunconstrained minimizationnegative curvatureline searchstep-size procedures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items (31)

On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds ⋮ On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem ⋮ Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines ⋮ Zwei trajektorienverfahren zur Lösung nichtlinearer optimierungsaufgaben ⋮ Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems ⋮ Curved search methods for unconstrained optimization ⋮ Modifications of the Wolfe line search rules to satisfy second-order optimality conditions in unconstrained optimization ⋮ Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization ⋮ Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems ⋮ Iterative grossone-based computation of negative curvature directions in large-scale optimization ⋮ Exploiting negative curvature in deterministic and stochastic optimization ⋮ Using negative curvature in solving nonlinear programs ⋮ A derivative-free modified tensor method with curvilinear linesearch for unconstrained nonlinear programming ⋮ Minimization methods for functions on simple sets ⋮ A modified Newton's method for minimizing factorable functions ⋮ An unconstrained optimization method using nonmonotone second order Goldstein's line search ⋮ Nonconvex optimization using negative curvature within a modified linesearch ⋮ Combining and scaling descent and negative curvature directions ⋮ A curvilinear search algorithm for unconstrained optimization by automatic differentiation ⋮ A curvilinear method based on minimal-memory BFGS updates ⋮ A geometric analysis of phase retrieval ⋮ On the final steps of Newton and higher order methods ⋮ A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization ⋮ Algorithm 1030: SC-SR1: MATLAB software for limited-memory SR1 trust-region methods ⋮ Accelerated optimization landscape of linear-quadratic regulator ⋮ Modified Newton methods for solving fully monolithic phase-field quasi-static brittle fracture propagation ⋮ Improving directions of negative curvature in an efficient manner ⋮ A restricted trust region algorithm for unconstrained optimization ⋮ The higher-order Levenberg–Marquardt method with Armijo type line search for nonlinear equations ⋮ Geometry and Symmetry in Short-and-Sparse Deconvolution ⋮ On a second order parallel variable transformation approach.

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

This page was built for publication: Curvilinear path steplength algorithms for minimization which use directions of negative curvature