Pages that link to "Item:Q4018383"
From MaRDI portal
The following pages link to Global Convergence Properties of Conjugate Gradient Methods for Optimization (Q4018383):
Displaying 50 items.
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping (Q1016416) (← links)
- A modified PRP conjugate gradient method (Q1026553) (← links)
- Hybrid conjugate gradient algorithm for unconstrained optimization (Q1028610) (← 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)
- Convergence rates of a global optimization algorithm (Q1186279) (← links)
- On the global optimization properties of finite-difference local descent algorithms (Q1207044) (← links)
- Convergence properties of the Beale-Powell restart algorithm (Q1286637) (← links)
- A class of nonmonotone conjugate gradient methods for unconstrained optimization (Q1293956) (← links)
- Global convergence result for conjugate gradient methods (Q1321117) (← links)
- Family of projected descent methods for optimization problems with simple bounds (Q1364228) (← links)
- A globally convergent version of the Polak-Ribière conjugate gradient method (Q1366426) (← links)
- Ab-initio prediction and reliability of protein structural genomics by PROPAINOR algorithm (Q1414257) (← links)
- Conjugate gradient methods with Armijo-type line searches. (Q1611089) (← 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)
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method (Q1634798) (← links)
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization (Q1644524) (← links)
- On the convergence of \(s\)-dependent GFR conjugate gradient method for unconstrained optimization (Q1652787) (← links)
- A deterministic optimization approach for solving the rainfall disaggregation problem (Q1653946) (← links)
- A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems (Q1663393) (← 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)
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search (Q1667567) (← links)
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix (Q1677473) (← links)
- Computational method for optimal control of switched systems with input and state constraints (Q1680805) (← links)
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems (Q1686668) (← links)
- A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization (Q1713190) (← links)
- A modified conjugacy condition and related nonlinear conjugate gradient method (Q1718989) (← links)
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems (Q1720973) (← links)
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization (Q1722397) (← links)
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence (Q1722876) (← links)
- A hybrid of DL and WYL nonlinear conjugate gradient methods (Q1723746) (← links)
- A new method with sufficient descent property for unconstrained optimization (Q1725328) (← links)
- New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods (Q1730830) (← links)
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search (Q1757395) (← links)
- Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) (← links)
- A new descent algorithm with curve search rule (Q1764727) (← links)
- The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization (Q1767963) (← links)
- A new family of conjugate gradient methods for unconstrained optimization (Q1786950) (← links)
- From linear to nonlinear iterative methods (Q1873166) (← links)
- A new variant of the memory gradient method for unconstrained optimization (Q1926613) (← links)
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q1937015) (← links)
- Nonmonotone spectral method for large-scale symmetric nonlinear equations (Q1938081) (← links)
- On the sufficient descent property of the Shanno's conjugate gradient method (Q1947631) (← links)
- Unscented/ensemble transform-based variational filter (Q1948083) (← links)
- The global convergence of a new mixed conjugate gradient method for unconstrained optimization (Q1952993) (← links)
- A class of gradient unconstrained minimization algorithms with adaptive stepsize (Q1970409) (← links)