On the method of shortest residuals for unconstrained optimization

DOI10.1007/s10957-007-9194-0zbMath1145.90105OpenAlexW2020904561MaRDI QIDQ2471088

Radosław Pytlak, Tomasz Tarnawski

Publication date: 18 February 2008

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

Full work available at URL: https://doi.org/10.1007/s10957-007-9194-0

zbMATH Keywords

Unconstrained optimizationConjugate gradient algorithms

Mathematics Subject Classification ID

Methods of reduced gradient type (90C52)

Related Items (3)

A non-monotone line search algorithm for unconstrained optimization ⋮ Method of conjugate subgradients with constrained memory ⋮ Convergence of conjugate gradient methods with constant stepsizes

Uses Software

• CUTEr
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global convergence of the method of shortest residuals
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Restart procedures for the conjugate gradient method
• On the Convergence of a New Conjugate Gradient Algorithm
• On the convergence of conjugate gradient algorithms
• CUTE
• Line search algorithms with guaranteed sufficient decrease
• An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Function minimization by conjugate gradients

This page was built for publication: On the method of shortest residuals for unconstrained optimization