Pages that link to "Item:Q3026775"

The following pages link to Convergence Properties of Algorithms for Nonlinear Optimization (Q3026775):

Displaying 50 items.

• Some modified conjugate gradient methods for unconstrained optimization (Q277201) (← links)
• A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
• A new class of nonlinear conjugate gradient coefficients with global convergence properties (Q387529) (← links)
• Global convergence of a nonlinear conjugate gradient method (Q410397) (← links)
• A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties (Q415335) (← links)
• Globally convergent modified Perry's conjugate gradient method (Q440856) (← links)
• Dai-Kou type conjugate gradient methods with a line search only using gradient (Q522525) (← links)
• A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update (Q523565) (← 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 Kalman-tracking filter approach to nonlinear programming (Q750314) (← links)
• New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems (Q849738) (← links)
• Convergence properties of the dependent PRP conjugate gradient methods (Q863032) (← links)
• Global convergence of a semi-infinite optimization method (Q912572) (← links)
• Conjugate gradient methods using quasi-Newton updates with inexact line searches (Q922642) (← links)
• Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems (Q964960) (← links)
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems (Q1001321) (← links)
• A modified PRP conjugate gradient method (Q1026553) (← links)
• A truncated descent HS conjugate gradient method and its global convergence (Q1036485) (← links)
• Numerical experiments with the one-dimensional non-linear simplex search (Q1184438) (← links)
• An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems (Q1194855) (← links)
• An adaptive conjugate gradient learning algorithm for efficient training of neural networks (Q1322892) (← links)
• A globally convergent version of the Polak-Ribière conjugate gradient method (Q1366426) (← links)
• Conjugate gradient methods with Armijo-type line searches. (Q1611089) (← links)
• A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method (Q1634798) (← links)
• A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems (Q1720973) (← links)
• Delamination of composites as a substationarity problem: Numerical approximation and algorithms (Q1912174) (← links)
• A new variant of the memory gradient method for unconstrained optimization (Q1926613) (← links)
• A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems (Q2004127) (← links)
• A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing (Q2004234) (← 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)
• The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems (Q2099954) (← 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)
• 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 penalty-free method with superlinear convergence for equality constrained optimization (Q2191791) (← links)
• The projection technique for two open problems of unconstrained optimization problems (Q2194129) (← links)
• A practical PR+ conjugate gradient method only using gradient (Q2250230) (← links)
• Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search (Q2290291) (← links)
• The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems (Q2301414) (← links)
• A conjugate gradient algorithm and its applications in image restoration (Q2301430) (← links)
• The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions (Q2315883) (← links)
• An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix (Q2336064) (← links)
• A conjugate gradient type method for the nonnegative constraints optimization problems (Q2375742) (← links)
• Global convergence of a modified conjugate gradient method (Q2405656) (← links)
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search (Q2433993) (← links)
• Nonlinear robust optimization via sequential convex bilevel programming (Q2434994) (← links)
• A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition (Q2515111) (← links)