Pages that link to "Item:Q875393"

The following pages link to New conjugacy condition and related new conjugate gradient methods for unconstrained optimization (Q875393):

Displaying 29 items.

• Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property (Q2340983) (← links)
• A modified Perry conjugate gradient method and its global convergence (Q2355321) (← links)
• A conjugate gradient type method for the nonnegative constraints optimization problems (Q2375742) (← links)
• Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization (Q2390003) (← links)
• Another hybrid conjugate gradient algorithm for unconstrained optimization (Q2481406) (← links)
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices (Q2514763) (← links)
• A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition (Q2515111) (← links)
• A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update (Q2628174) (← links)
• A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter (Q2868907) (← links)
• Sufficient descent conjugate gradient methods for large-scale optimization problems (Q2885559) (← links)
• Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition (Q2969958) (← links)
• A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems (Q3016307) (← links)
• A new search procedure of steepest ascent in response surface exploration (Q3019820) (← links)
• A new class of efficient and globally convergent conjugate gradient methods in the Dai–Liao family (Q3458820) (← links)
• A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q4638925) (← links)
• Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks (Q4657813) (← links)
• A Conjugate Gradient Method Based on a Modified Secant Relation for Unconstrained Optimization (Q4959904) (← links)
• Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization (Q5028623) (← links)
• An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization (Q5200551) (← links)
• (Q5215146) (← links)
• A NEW DERIVATIVE-FREE CONJUGATE GRADIENT METHOD FOR LARGE-SCALE NONLINEAR SYSTEMS OF EQUATIONS (Q5269727) (← links)
• Two hybrid nonlinear conjugate gradient methods based on a modified secant equation (Q5495572) (← links)
• A descent family of Dai–Liao conjugate gradient methods (Q5746716) (← links)
• A modified conjugate gradient method based on a modified secant equation (Q5855677) (← links)
• New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters (Q5855678) (← links)
• New conjugacy conditions and related nonlinear conjugate gradient methods (Q5929889) (← links)
• On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications (Q6150644) (← links)
• A family of accelerated hybrid conjugate gradient method for unconstrained optimization and image restoration (Q6586095) (← links)
• On the extension of Dai-Liao conjugate gradient method for vector optimization (Q6636812) (← links)