Two facts on the convergence of the Cauchy algorithm

DOI10.1023/A:1026451300170zbMath1168.90611MaRDI QIDQ1841573

Clóvis C. Gonzaga

Publication date: 18 February 2001

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

zbMATH Keywords

convex programmingnonlinear programmingsteepest descentCauchy method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (4)

On the convergence of a new hybrid projection algorithm ⋮ Generalization: One technique of computational and applied mathematical methodology ⋮ Convergence properties of nonmonotone spectral projected gradient methods ⋮ On perturbed steepest descent methods with inexact line search for bilevel convex optimization

Cites Work

• Optimization. Algorithms and consistent approximations
• Convergence of the steepest descent method for minimizing quasiconvex functions
• The stabilizing properties of the gradient method
• Full convergence of the steepest descent method with inexact line searches

This page was built for publication: Two facts on the convergence of the Cauchy algorithm