Pages that link to "Item:Q120734"

The following pages link to A simple three-term conjugate gradient algorithm for unconstrained optimization (Q120734):

Displaying 46 items.

• A new three-term conjugate gradient algorithm for unconstrained optimization (Q120735) (← links)
• ttcg (Q120739) (← links)
• Comment on ``A new three-term conjugate gradient method for unconstrained problem'' (Q285045) (← links)
• A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations (Q667882) (← links)
• New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction (Q668710) (← links)
• Some three-term conjugate gradient methods with the inexact line search condition (Q723556) (← links)
• A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations (Q724489) (← links)
• An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q1626534) (← links)
• An improved Perry conjugate gradient method with adaptive parameter choice (Q1656676) (← links)
• An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix (Q1677473) (← links)
• A subspace conjugate gradient algorithm for large-scale unconstrained optimization (Q1681785) (← links)
• Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization (Q1718269) (← links)
• A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence (Q1722876) (← links)
• Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations (Q2063152) (← links)
• A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration (Q2068018) (← links)
• A new accelerated conjugate gradient method for large-scale unconstrained optimization (Q2068094) (← links)
• Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications (Q2068628) (← links)
• Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations (Q2107668) (← links)
• Derivative-free method based on DFP updating formula for solving convex constrained nonlinear monotone equations and application (Q2130906) (← links)
• A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection (Q2133373) (← links)
• A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems (Q2146720) (← links)
• A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property (Q2201566) (← links)
• An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q2240113) (← links)
• Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization (Q2299208) (← links)
• Some three-term conjugate gradient methods with the new direction structure (Q2301307) (← links)
• A class of globally convergent three-term Dai-Liao conjugate gradient methods (Q2301403) (← links)
• A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition (Q2346398) (← links)
• A new modified three-term conjugate gradient method with sufficient descent property and its global convergence (Q2421741) (← links)
• A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition (Q2515111) (← links)
• A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems (Q2700161) (← links)
• A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization (Q2790872) (← links)
• A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2826251) (← links)
• New three-term conjugate gradient method with guaranteed global convergence (Q2935391) (← links)
• Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition (Q2969958) (← links)
• An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems (Q3453426) (← links)
• An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method (Q4631766) (← links)
• A NEW THREE–TERM CONJUGATE GRADIENT METHOD WITH DESCENT DIRECTION FOR UNCONSTRAINED OPTIMIZATION (Q5011628) (← links)
• Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization (Q5028623) (← links)
• Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination (Q5277965) (← links)
• A class of spectral three-term descent Hestenes-Stiefel conjugate gradient algorithms for large-scale unconstrained optimization and image restoration problems (Q6064895) (← links)
• A modified four-term extension of the Dai-Liao conjugate gradient method (Q6086969) (← links)
• Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization (Q6110199) (← links)
• A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model (Q6137748) (← links)
• A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems (Q6156109) (← links)
• A new hybrid three-term LS-CD conjugate gradient in solving unconstrained optimization problems (Q6548343) (← links)
• A three-term conjugate gradient descent method with some applications (Q6609603) (← links)