The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches

DOI10.1016/S0898-1221(01)00141-9zbMath0989.90120WikidataQ126459532 ScholiaQ126459532MaRDI QIDQ5948829

Jan A. Snyman, A. M. Hay

Publication date: 12 November 2001

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

unconstrained minimizationsteepest descentill-conditioning

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items (5)

Incomplete series expansion for function approximation ⋮ The application of gradient-only optimization methods for problems discretized using non-constant methods ⋮ Gradient-only approaches to avoid spurious local minima in unconstrained optimization ⋮ The dynamic-Q optimization method: an alternative to SQP? ⋮ A quadratic approximation for structural topology optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Line search algorithms with guaranteed sufficient decrease
• Function minimization by conjugate gradients

This page was built for publication: The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches