Pages that link to "Item:Q2433993"

The following pages link to Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search (Q2433993):

Displaying 50 items.

• Spectral method and its application to the conjugate gradient method (Q279183) (← links)
• An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems (Q364742) (← links)
• The convergence rate of a restart MFR conjugate gradient method with inexact line search (Q387662) (← 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)
• Global convergence of a modified spectral conjugate gradient method (Q411054) (← 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)
• A mixed spectral CD-DY conjugate gradient method (Q442966) (← links)
• Global convergence of a spectral conjugate gradient method for unconstrained optimization (Q448802) (← links)
• An extension of the Fletcher-Reeves method to linear equality constrained optimization problem (Q482439) (← links)
• Norm descent conjugate gradient methods for solving symmetric nonlinear equations (Q496604) (← links)
• A limited memory descent Perry conjugate gradient method (Q518141) (← links)
• A modified CG-DESCENT method for unconstrained optimization (Q535462) (← links)
• Sufficient descent directions in unconstrained optimization (Q538309) (← 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)
• A simple sufficient descent method for unconstrained optimization (Q613840) (← links)
• A variant spectral-type FR conjugate gradient method and its global convergence (Q628913) (← links)
• Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping (Q632862) (← links)
• \(n\)-step quadratic convergence of the MPRP method with a restart strategy (Q633952) (← links)
• Global convergence of some modified PRP nonlinear conjugate gradient methods (Q644512) (← links)
• New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction (Q668710) (← links)
• FR type methods for systems of large-scale nonlinear monotone equations (Q668736) (← links)
• A new class of nonmonotone conjugate gradient training algorithms (Q669374) (← links)
• A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations (Q670796) (← links)
• A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations (Q724489) (← links)
• A conjugate gradient method with sufficient descent property (Q747726) (← links)
• A modified bat algorithm with conjugate gradient method for global optimization (Q779965) (← links)
• Sufficient descent nonlinear conjugate gradient methods with conjugacy condition (Q849150) (← links)
• A new conjugate gradient algorithm for training neural networks based on a modified secant equation (Q905328) (← links)
• Global convergence of a modified spectral FR conjugate gradient method (Q942404) (← links)
• A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems (Q1004008) (← links)
• A limited memory BFGS-type method for large-scale unconstrained optimization (Q1004767) (← links)
• Two modified Dai-Yuan nonlinear conjugate gradient methods (Q1014353) (← links)
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
• An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation (Q1039699) (← links)
• A descent hybrid conjugate gradient method based on the memoryless BFGS update (Q1625764) (← links)
• An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q1626534) (← links)
• A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems (Q1649149) (← links)
• A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems (Q1663393) (← links)
• The solution of two-phase inverse Stefan problem based on a hybrid method with optimization (Q1665351) (← links)
• An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints (Q1713630) (← links)
• Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization (Q1718269) (← links)
• A modified conjugacy condition and related nonlinear conjugate gradient method (Q1718989) (← links)
• Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems (Q1725277) (← links)
• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
• New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods (Q1730830) (← links)
• A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations (Q1751397) (← links)
• Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) (← links)