Pages that link to "Item:Q5929889"
From MaRDI portal
The following pages link to New conjugacy conditions and related nonlinear conjugate gradient methods (Q5929889):
Displayed 50 items.
- On three-term conjugate gradient algorithms for unconstrained optimization (Q120733) (← links)
- A new three-term conjugate gradient algorithm for unconstrained optimization (Q120735) (← links)
- An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property (Q267707) (← links)
- On Hager and Zhang's conjugate gradient method with guaranteed descent (Q273329) (← links)
- New hybrid conjugate gradient method for unconstrained optimization (Q278565) (← links)
- Spectral method and its application to the conjugate gradient method (Q279183) (← links)
- An optimal parameter for Dai-Liao family of conjugate gradient methods (Q289129) (← links)
- Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization (Q357379) (← links)
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems (Q364742) (← links)
- Symmetric Perry conjugate gradient method (Q377723) (← links)
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization (Q382920) (← links)
- A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence (Q408488) (← links)
- Global convergence of a nonlinear conjugate gradient method (Q410397) (← links)
- A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization (Q421813) (← links)
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (Q438775) (← links)
- Globally convergent modified Perry's conjugate gradient method (Q440856) (← links)
- Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization (Q442712) (← links)
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization (Q457047) (← links)
- An improved nonlinear conjugate gradient method with an optimal property (Q476750) (← links)
- Two modified three-term conjugate gradient methods with sufficient descent property (Q479259) (← links)
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods (Q483732) (← links)
- An adaptive conjugate gradient algorithm for large-scale unconstrained optimization (Q495053) (← links)
- Norm descent conjugate gradient methods for solving symmetric nonlinear equations (Q496604) (← links)
- A modified CG-DESCENT method for unconstrained optimization (Q535462) (← links)
- Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints (Q545595) (← links)
- Two modified HS type conjugate gradient methods for unconstrained optimization problems (Q611200) (← links)
- A conjugate gradient method with sufficient descent property (Q747726) (← links)
- Sufficient descent nonlinear conjugate gradient methods with conjugacy condition (Q849150) (← links)
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization (Q875393) (← links)
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q878996) (← links)
- Multi-step nonlinear conjugate gradient methods for unconstrained minimization (Q953210) (← links)
- Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems (Q964960) (← links)
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization (Q970585) (← links)
- Two new conjugate gradient methods based on modified secant equations (Q972741) (← links)
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization (Q989146) (← links)
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems (Q1001321) (← links)
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems (Q1004008) (← links)
- Hybrid conjugate gradient algorithm for unconstrained optimization (Q1028610) (← links)
- Acceleration of conjugate gradient algorithms for unconstrained optimization (Q1029371) (← links)
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
- A truncated descent HS conjugate gradient method and its global convergence (Q1036485) (← links)
- Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) (← links)
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q1937015) (← links)
- On the sufficient descent property of the Shanno's conjugate gradient method (Q1947631) (← links)
- Convergence properties of an iterative method for solving symmetric non-linear equations (Q2260665) (← links)
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q2267641) (← links)
- Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property (Q2340983) (← links)
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization (Q2346397) (← links)
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition (Q2346398) (← links)
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization (Q2390003) (← links)