The following pages link to (Q3313210):
Displaying 50 items.
- 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)
- Some modified conjugate gradient methods for unconstrained optimization (Q277201) (← links)
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- A new class of nonlinear conjugate gradient coefficients with global convergence properties (Q387529) (← links)
- Two modified scaled nonlinear conjugate gradient methods (Q390466) (← links)
- Global convergence of a nonlinear conjugate gradient method (Q410397) (← links)
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties (Q415335) (← links)
- A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization (Q421813) (← links)
- Globally convergent modified Perry's conjugate gradient method (Q440856) (← links)
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization (Q457047) (← links)
- The divergence of the BFGS and Gauss Newton methods (Q463731) (← links)
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods (Q483732) (← links)
- A modified three-term PRP conjugate gradient algorithm for optimization models (Q527794) (← links)
- Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search (Q531627) (← links)
- A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization (Q555476) (← links)
- New spectral PRP conjugate gradient method for unconstrained optimization (Q607139) (← links)
- New step lengths in conjugate gradient methods (Q611340) (← links)
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates (Q645035) (← links)
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches (Q668235) (← links)
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction (Q668710) (← links)
- A new class of nonmonotone conjugate gradient training algorithms (Q669374) (← links)
- A class of nonmonotone conjugate gradient methods for nonconvex functions (Q698383) (← links)
- Quadratic cost flow and the conjugate gradient method (Q707094) (← links)
- A conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization (Q737229) (← links)
- A centroid-based gene selection method for microarray data classification (Q738623) (← links)
- A dynamical view of nonlinear conjugate gradient methods with applications to FFT-based computational micromechanics (Q785497) (← links)
- An example of numerical nonconvergence of a variable-metric method (Q795739) (← links)
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems (Q849738) (← links)
- Convergence properties of the dependent PRP conjugate gradient methods (Q863032) (← links)
- The convergence properties of some new conjugate gradient methods (Q865594) (← links)
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization (Q875393) (← links)
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization (Q883860) (← links)
- A new conjugate gradient algorithm for training neural networks based on a modified secant equation (Q905328) (← links)
- Efficient generalized conjugate gradient algorithms. I: Theory (Q915657) (← links)
- Multi-step nonlinear conjugate gradient methods for unconstrained minimization (Q953210) (← links)
- A conjugate gradient method for unconstrained optimization problems (Q963493) (← links)
- Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems (Q964960) (← links)
- Two new conjugate gradient methods based on modified secant equations (Q972741) (← links)
- A note about WYL's conjugate gradient method and its applications (Q990447) (← 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 method for a convex optimization problem over the fixed-point set of a nonexpansive mapping (Q1016416) (← links)
- A modified PRP conjugate gradient method (Q1026553) (← links)
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search (Q1049322) (← links)
- Efficient hybrid conjugate gradient techniques (Q1117142) (← links)
- Large sparse continuation problems (Q1263940) (← links)
- Convergence properties of the Beale-Powell restart algorithm (Q1286637) (← links)
