Unconstrained Optimization by Approximation of the Gradient Path

DOI10.1287/MOOR.2.3.253MaRDI QIDQ4178791zbMATH OpenOpenAlexFDO

Authors Jean-Philippe Vial, Israel Zang

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

AlgorithmApproximation of the Gradient PathConvergenceInverse HessianNonlinear Programming

Mathematics Subject Classification ID

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

Cited in

(7)

• 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
• Tunneling decay of false domain walls: the silence of the lambs
• Curvilinear path steplength algorithms for minimization which use directions of negative curvature
• A new arc algorithm for unconstrained optimization
• A trajectory-based method for constrained nonlinear optimization problems
• Differential optimization techniques

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178791)