Greatest descent algorithms in unconstrained optimization

DOI10.1007/s10957-009-9533-4zbMath1175.90370OpenAlexW2053902925MaRDI QIDQ1035932

Bean San Goh

Publication date: 4 November 2009

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-009-9533-4

zbMATH Keywords

unconstrained optimizationNewton methodgreatest descent directionLevenberg-Marquardt formulatwo-dimensional search directions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items

On the rate of convergence of projected Barzilai–Borwein methods ⋮ Convergence and stability of line search methods for unconstrained optimization ⋮ On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints ⋮ Approximate greatest descent in neural network optimization ⋮ Approximate greatest descent methods for optimization with equality constraints ⋮ On the bang-bang control approach via a component-wise line search strategy for unconstrained optimization

Uses Software

• KELLEY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for unconstrained optimization problems via control theory
• On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
• Two-Point Step Size Gradient Methods
• Numerical Optimization
• Alternate step gradient method*
• Gradient Transformation Trajectory Following Algorithms for Determining Stationary Min-Max Saddle Points