scientific article; zbMATH DE number 2063453
From MaRDI portal
Publication:4461063
zbMath1041.65048MaRDI QIDQ4461063
Publication date: 29 March 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
numerical resultsconjugate gradient methodssteepest descent methodlarge-scale unconstrained optimization problems
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items
On Hager and Zhang's conjugate gradient method with guaranteed descent ⋮ A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization ⋮ A globally convergent hybrid conjugate gradient method and its numerical behaviors ⋮ A new version of the Liu-Storey conjugate gradient method ⋮ New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems ⋮ Convergence of the Polak-Ribiére-Polyak conjugate gradient method ⋮ A class of one parameter conjugate gradient methods ⋮ Two modified scaled nonlinear conjugate gradient methods ⋮ A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods ⋮ Global convergence of a modified Fletcher–Reeves conjugate gradient method with Wolfe line search ⋮ On the sufficient descent property of the Shanno's conjugate gradient method ⋮ A mixed spectral CD-DY conjugate gradient method ⋮ Global convergence of a modified LS method ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ Some nonlinear conjugate gradient methods based on spectral scaling secant equations ⋮ New quasi-Newton methods for unconstrained optimization problems ⋮ Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems ⋮ New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization ⋮ A Conjugate Gradient Method Based on a Modified Secant Relation for Unconstrained Optimization ⋮ A conjugate gradient method with sufficient descent property ⋮ A modified PRP conjugate gradient method ⋮ Penalty algorithm based on conjugate gradient method for solving portfolio management problem
Uses Software
