The following pages link to (Q5563083):
Displaying 50 items.
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← 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)
- Conjugate gradient algorithms in nonlinear structural analysis problems (Q1077990) (← links)
- A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms (Q1138482) (← links)
- Some computational advances in unconstrained optimization (Q1154219) (← links)
- Conjugate gradient methods for continuation problems (Q1184104) (← links)
- Tracing post-limit-point paths with incomplete or without factorization of the stiffness matrix (Q1190441) (← links)
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory (Q1241969) (← links)
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications (Q1241970) (← links)
- Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben (Q1242859) (← links)
- Nonoptimal termination properties of quadratic interpolation univariate searches (Q1249520) (← links)
- In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization (Q1255894) (← links)
- Large sparse continuation problems (Q1263940) (← links)
- Convergence properties of the Beale-Powell restart algorithm (Q1286637) (← links)
- MERLIN-3. 0. A multidimensional optimization environment (Q1299612) (← links)
- An adaptive conjugate gradient learning algorithm for efficient training of neural networks (Q1322892) (← links)
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. (Q1406626) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- Variable metric methods for unconstrained optimization and nonlinear least squares (Q1593813) (← links)
- Conjugate gradient methods with Armijo-type line searches. (Q1611089) (← links)
- A robust descent type algorithm for geophysical inversion through adaptive regularization (Q1614201) (← links)
- A descent hybrid conjugate gradient method based on the memoryless BFGS update (Q1625764) (← links)
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method (Q1634798) (← links)
- A PRP-based residual method for large-scale monotone nonlinear equations (Q1643265) (← links)
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization (Q1644524) (← links)
- Numerical integration of implicit functions for the initialization of the VOF function (Q1645661) (← links)
- A class of one parameter conjugate gradient methods (Q1664259) (← links)
- An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search (Q1664598) (← links)
- A spectral dai-yuan-type conjugate gradient method for unconstrained optimization (Q1666716) (← 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)
- Comments on ``Hybrid conjugate gradient algorithm for unconstrained optimization'' (Q1682986) (← links)
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems (Q1686668) (← links)
- Conjugate gradient based acceleration for inverse problems (Q1686866) (← links)
- An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints (Q1713630) (← links)
- Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization (Q1718269) (← links)
- A conjugate gradient algorithm under Yuan-Wei-Lu line search technique for large-scale minimization optimization models (Q1720966) (← links)
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems (Q1720973) (← 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)
- On the strong convergence of a sufficient descent Polak-Ribière-Polyak conjugate gradient method (Q1723758) (← links)
- Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations (Q1723812) (← links)
- The hybrid BFGS-CG method in solving unconstrained optimization problems (Q1724270) (← links)
- Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems (Q1725277) (← links)
- New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods (Q1730830) (← links)
- The initialisation of volume fractions for unstructured grids using implicit surface definitions. (Q1739686) (← 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 mixed formulation for the Signorini problem in nearly incompressible elasticity (Q1779819) (← links)
