Global convergence of the method of shortest residuals
From MaRDI portal
Publication:1964048
DOI10.1007/s002119900080zbMath0949.65065OpenAlexW2046957724MaRDI QIDQ1964048
Publication date: 11 December 2000
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002119900080
global convergencenumerical resultsLipschitz continuitymethod of shortest residualsstandard nonlinear conjugate gradient method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Related Items (8)
A new class of supermemory gradient methods ⋮ Method of conjugate subgradients with constrained memory ⋮ GLOBAL CONVERGENCE OF SHORTEST-RESIDUAL FAMILY OF CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH ⋮ On the method of shortest residuals for unconstrained optimization ⋮ A new class of projection and contraction methods for solving variational inequality problems ⋮ Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization ⋮ Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints ⋮ Convergence of conjugate gradient methods with constant stepsizes
This page was built for publication: Global convergence of the method of shortest residuals