Pages that link to "Item:Q5317554"
From MaRDI portal
The following pages link to A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search (Q5317554):
Displaying 50 items.
- A modified three-term PRP conjugate gradient algorithm for optimization models (Q527794) (← links)
- Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search (Q531627) (← links)
- A modified CG-DESCENT method for unconstrained optimization (Q535462) (← links)
- Applying powell's symmetrical technique to conjugate gradient methods (Q540656) (← links)
- Combining and scaling descent and negative curvature directions (Q543412) (← links)
- A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization (Q555476) (← links)
- The convergence of conjugate gradient method with nonmonotone line search (Q606706) (← links)
- Two modified HS type conjugate gradient methods for unconstrained optimization problems (Q611200) (← links)
- A simple sufficient descent method for unconstrained optimization (Q613840) (← links)
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy (Q633952) (← links)
- Global convergence of some modified PRP nonlinear conjugate gradient methods (Q644512) (← links)
- A sufficient descent LS conjugate gradient method for unconstrained optimization problems (Q654620) (← links)
- Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search (Q662895) (← links)
- A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations (Q667882) (← links)
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches (Q668235) (← links)
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction (Q668710) (← links)
- A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations (Q670796) (← links)
- CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method (Q679580) (← links)
- A dynamic-solver-consistent minimum action method: with an application to 2D Navier-Stokes equations (Q680208) (← links)
- On a conjugate directions method for solving strictly convex QP problem (Q684136) (← links)
- A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique (Q723782) (← links)
- A conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
- Instabilities in shear and simple shear deformations of gold crystals (Q732624) (← links)
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization (Q737229) (← links)
- A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization (Q747220) (← links)
- A conjugate gradient method with sufficient descent property (Q747726) (← links)
- Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems (Q821530) (← links)
- Sufficient descent nonlinear conjugate gradient methods with conjugacy condition (Q849150) (← links)
- A new conjugate gradient algorithm for training neural networks based on a modified secant equation (Q905328) (← links)
- Discrete second order adjoints in atmospheric chemical transport modeling (Q939469) (← links)
- A conjugate gradient method for unconstrained optimization problems (Q963493) (← links)
- A globally convergent derivative-free method for solving large-scale nonlinear monotone equations (Q966075) (← links)
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization (Q970585) (← links)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems (Q975360) (← links)
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints (Q985699) (← links)
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization (Q989146) (← links)
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems (Q1001321) (← links)
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems (Q1004008) (← links)
- A limited memory BFGS-type method for large-scale unconstrained optimization (Q1004767) (← links)
- Two modified Dai-Yuan nonlinear conjugate gradient methods (Q1014353) (← links)
- Improving directions of negative curvature in an efficient manner (Q1026565) (← links)
- Hybrid conjugate gradient algorithm for unconstrained optimization (Q1028610) (← links)
- Acceleration of conjugate gradient algorithms for unconstrained optimization (Q1029371) (← links)
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
- A truncated descent HS conjugate gradient method and its global convergence (Q1036485) (← 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)
- A descent hybrid conjugate gradient method based on the memoryless BFGS update (Q1625764) (← links)
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q1626534) (← links)
