Pages that link to "Item:Q1117142"

The following pages link to Efficient hybrid conjugate gradient techniques (Q1117142):

Displaying 50 items.

• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
• An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property (Q267707) (← links)
• New hybrid conjugate gradient method for unconstrained optimization (Q278565) (← links)
• A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
• A nonmonotone trust region method with new inexact line search for unconstrained optimization (Q369443) (← links)
• A new class of nonlinear conjugate gradient coefficients with global convergence properties (Q387529) (← links)
• A modified three-term PRP conjugate gradient algorithm for optimization models (Q527794) (← links)
• A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches (Q668235) (← links)
• A conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
• A self-adaptive trust region method with line search based on a simple subproblem model (Q843159) (← links)
• Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods (Q856066) (← links)
• The convergence properties of some new conjugate gradient methods (Q865594) (← links)
• A descent nonlinear conjugate gradient method for large-scale unconstrained optimization (Q883860) (← links)
• A conjugate gradient method for unconstrained optimization problems (Q963493) (← 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)
• A generalized conjugate gradient algorithm (Q1265069) (← links)
• A class of nonmonotone conjugate gradient methods for unconstrained optimization (Q1293956) (← links)
• Optimization by pattern search (Q1342017) (← links)
• A descent hybrid conjugate gradient method based on the memoryless BFGS update (Q1625764) (← links)
• An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search (Q1664598) (← links)
• A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization (Q1665439) (← links)
• New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods (Q1730830) (← links)
• The global convergence of a new mixed conjugate gradient method for unconstrained optimization (Q1952993) (← links)
• Space-decomposition minimization method for large-scale minimization problems (Q1963007) (← links)
• Further insight into the convergence of the Fletcher-Reeves method (Q1974184) (← links)
• A new hybrid PRPFR conjugate gradient method for solving nonlinear monotone equations and image restoration problems (Q2004132) (← links)
• A modified nonlinear conjugate gradient method with the Armijo line search and its application (Q2007123) (← links)
• A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q2017614) (← links)
• Hybrid Riemannian conjugate gradient methods with global convergence properties (Q2023690) (← links)
• Improved conjugate gradient method for nonlinear system of equations (Q2027665) (← links)
• A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration (Q2068018) (← links)
• Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications (Q2068628) (← links)
• A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection (Q2133373) (← links)
• New hybrid conjugate gradient method as a convex combination of LS and FR methods (Q2150719) (← links)
• A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization (Q2184373) (← links)
• The projection technique for two open problems of unconstrained optimization problems (Q2194129) (← links)
• A spectral conjugate gradient method for solving large-scale unconstrained optimization (Q2203770) (← links)
• A survey of gradient methods for solving nonlinear optimization (Q2220680) (← links)
• A global convergence of LS-CD hybrid conjugate gradient method (Q2248683) (← links)
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
• The convergence properties of RMIL+ conjugate gradient method under the strong Wolfe line search (Q2284804) (← links)
• A hybrid conjugate gradient method with descent property for unconstrained optimization (Q2337555) (← links)
• A nonmonotone hybrid conjugate gradient method for unconstrained optimization (Q2340982) (← links)
• Two descent hybrid conjugate gradient methods for optimization (Q2483351) (← links)
• A three-parameter family of nonlinear conjugate gradient methods (Q2719070) (← links)
• Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions (Q2821800) (← links)
• A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter (Q2868907) (← links)
• A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems (Q3083525) (← links)
• Nonlinear conjugate gradient method for spectral tomosynthesis (Q5197862) (← links)