New conjugacy conditions and related nonlinear conjugate gradient methods
From MaRDI portal
Publication:5929889
DOI10.1007/s002450010019zbMath0973.65050MaRDI QIDQ5929889
Publication date: 17 April 2001
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002450010019
convergence; numerical examples; conjugacy condition; inexact line search; nonlinear conjugate gradient methods; unstrained optimization
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C53: Methods of quasi-Newton type
Related Items
An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization, Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization, Two hybrid nonlinear conjugate gradient methods based on a modified secant equation, A modified Polak–Ribi‘ere–Polyak descent method for unconstrained optimization, A descent family of Dai–Liao conjugate gradient methods, An efficient adaptive scaling parameter for the spectral conjugate gradient method, A new efficient conjugate gradient method for unconstrained optimization, On three-term conjugate gradient algorithms for unconstrained optimization, A new three-term conjugate gradient algorithm for unconstrained optimization, An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property, On Hager and Zhang's conjugate gradient method with guaranteed descent, New hybrid conjugate gradient method for unconstrained optimization, Spectral method and its application to the conjugate gradient method, An optimal parameter for Dai-Liao family of conjugate gradient methods, Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization, An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems, Symmetric Perry conjugate gradient method, Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization, A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence, Global convergence of a nonlinear conjugate gradient method, A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization, Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization, Globally convergent modified Perry's conjugate gradient method, Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization, An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization, An improved nonlinear conjugate gradient method with an optimal property, Two modified three-term conjugate gradient methods with sufficient descent property, On the sufficient descent condition of the Hager-Zhang conjugate gradient methods, An adaptive conjugate gradient algorithm for large-scale unconstrained optimization, Norm descent conjugate gradient methods for solving symmetric nonlinear equations, A modified CG-DESCENT method for unconstrained optimization, Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints, Two modified HS type conjugate gradient methods for unconstrained optimization problems, A conjugate gradient method with sufficient descent property, Sufficient descent nonlinear conjugate gradient methods with conjugacy condition, New conjugacy condition and related new conjugate gradient methods for unconstrained optimization, A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization, Multi-step nonlinear conjugate gradient methods for unconstrained minimization, Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems, Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization, Two new conjugate gradient methods based on modified secant equations, New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization, Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems, A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems, Hybrid conjugate gradient algorithm for unconstrained optimization, Acceleration of conjugate gradient algorithms for unconstrained optimization, Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization, A truncated descent HS conjugate gradient method and its global convergence, Conjugate gradient methods using value of objective function for unconstrained optimization, A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods, On the sufficient descent property of the Shanno's conjugate gradient method, Convergence properties of an iterative method for solving symmetric non-linear equations, Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization, Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property, A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization, A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition, Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization, Scaled conjugate gradient algorithms for unconstrained optimization, Another hybrid conjugate gradient algorithm for unconstrained optimization, Some sufficient descent conjugate gradient methods and their global convergence, The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices, A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization, A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition, A sufficient descent Liu–Storey conjugate gradient method and its global convergence, A sufficient descent conjugate gradient method and its global convergence, A MODIFIED PROJECTED CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION PROBLEMS, A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization, A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter, Sufficient descent conjugate gradient methods for large-scale optimization problems, New conjugate gradient-like methods for unconstrained optimization, A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization, A nonlinear conjugate gradient method based on the MBFGS secant condition, Two optimal Dai–Liao conjugate gradient methods, An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems, A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach, A new class of efficient and globally convergent conjugate gradient methods in the Dai–Liao family, A scaled nonlinear conjugate gradient algorithm for unconstrained optimization, Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
Uses Software
