Pages that link to "Item:Q1001321"

The following pages link to Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems (Q1001321):

Displaying 50 items.

• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
• A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
• Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization (Q357379) (← links)
• An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems (Q364742) (← links)
• Nonlinear conjugate gradient methods with Wolfe type line search (Q370171) (← links)
• A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization (Q370232) (← links)
• Global convergence of a modified spectral conjugate gradient method (Q411054) (← links)
• Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization (Q442712) (← links)
• Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence (Q499680) (← links)
• Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method (Q508045) (← links)
• A quasi-Newton algorithm for large-scale nonlinear equations (Q509967) (← links)
• A modified three-term PRP conjugate gradient algorithm for optimization models (Q527794) (← links)
• A modified three-term conjugate gradient method with sufficient descent property (Q530722) (← links)
• An active set limited memory BFGS algorithm for bound constrained optimization (Q638888) (← links)
• Global convergence of some modified PRP nonlinear conjugate gradient methods (Q644512) (← links)
• A Kronecker approximation with a convex constrained optimization method for blind image restoration (Q694158) (← links)
• A multimethod technique for solving optimal control problem (Q694172) (← links)
• A conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
• A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
• Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems (Q821530) (← links)
• A conjugate gradient method for unconstrained optimization problems (Q963493) (← links)
• An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation (Q1039699) (← links)
• Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search (Q1049322) (← links)
• Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations (Q1630965) (← links)
• A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method (Q1634798) (← links)
• A new adaptive trust region algorithm for optimization problems (Q1637037) (← links)
• A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization (Q1644524) (← links)
• An improved Perry conjugate gradient method with adaptive parameter choice (Q1656676) (← links)
• On global convergence of gradient descent algorithms for generalized phase retrieval problem (Q1675386) (← links)
• A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems (Q1720973) (← links)
• Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems (Q1725277) (← links)
• Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) (← links)
• A new supermemory gradient method for unconstrained optimization problems (Q1758038) (← links)
• A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q1937015) (← links)
• The global convergence of a new mixed conjugate gradient method for unconstrained optimization (Q1952993) (← links)
• A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing (Q2004234) (← links)
• A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems (Q2010240) (← links)
• A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q2017614) (← links)
• The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique (Q2067951) (← links)
• A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems (Q2072782) (← links)
• Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization (Q2073942) (← links)
• A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions (Q2103175) (← links)
• Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions (Q2163450) (← links)
• The global convergence of the BFGS method with a modified WWP line search for nonconvex functions (Q2163462) (← links)
• Global convergence of a modified Broyden family method for nonconvex functions (Q2171116) (← links)
• A distributed conjugate gradient online learning method over networks (Q2173726) (← links)
• Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions (Q2189404) (← links)
• A class of accelerated conjugate-gradient-like methods based on a modified secant equation (Q2190281) (← links)
• The projection technique for two open problems of unconstrained optimization problems (Q2194129) (← links)
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)