Two facts on the convergence of the Cauchy algorithm

DOI10.1023/A:1026451300170MaRDI QIDQ1841573zbMATH OpenFDO

Authors C. C. Gonzaga

Publication date 18 February 2001

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

zbMATH Keywords

nonlinear programmingconvex programmingsteepest descentCauchy method

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1896924
• A convergence result for the \(B\)-algorithm
• On the convergence of certain iterative methods
• scientific article; zbMATH DE number 3888817
• Convergence of r-algorithms
• On convergence of two-stage iterative scheme
• scientific article; zbMATH DE number 3926395
• On the convergence factor of Uzawa's algorithm
• The convergence of Fletcher-Reeves algorithm
• The convergence of the Weiszfeld algorithm

Cites work

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

Cited in

(4)

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

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

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