Unconstrained Optimization by Approximation of the Gradient Path

DOI10.1287/moor.2.3.253zbMath0395.90066OpenAlexW2025997531MaRDI QIDQ4178791

Israel Zang, Jean-Philippe Vial

Publication date: 1977

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2.3.253

zbMATH Keywords

AlgorithmConvergenceNonlinear ProgrammingApproximation of the Gradient PathInverse Hessian

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (7)

Curvilinear path steplength algorithms for minimization which use directions of negative curvature ⋮ A trajectory-based method for constrained nonlinear optimization problems ⋮ Tunneling decay of false domain walls: The silence of the lambs ⋮ A new arc algorithm for unconstrained optimization ⋮ Differential optimization techniques ⋮ Nonmonotonic reduced projected Hessian method via an affine scaling interior modified gradient path for bounded-constrained optimization ⋮ On the convergence of curvilinear search algorithms in unconstrained optimization

This page was built for publication: Unconstrained Optimization by Approximation of the Gradient Path