Pages that link to "Item:Q2549991"
From MaRDI portal
The following pages link to Comparison of some conjugate direction procedures for function minimization (Q2549991):
Displaying 16 items.
- Efficient generalized conjugate gradient algorithms. I: Theory (Q915657) (← links)
- Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems (Q964960) (← 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)
- Computational experience with conjugate gradient algorithms (Q1146505) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← 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)
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization (Q2515066) (← links)
- Unconstrained approach to the extremization of constrained functions (Q2553077) (← links)
- A Rank Two Algorithm for Unconstrained Minimization (Q4053025) (← links)
- Convergence conditions for restarted conjugate gradient methods with inaccurate line searches (Q4090137) (← links)
- Simulating comparisons of different computing algorithms fitting zero-inflated Poisson models for zero abundant counts (Q5106959) (← links)
- A constraint-space conjugate gradient method for function minimization and optimal control problems† (Q5634533) (← links)
- Practical convergence conditions for unconstrained optimization (Q5685870) (← links)
- On the Preconditioned Delayed Weighted Gradient Method (Q6177046) (← links)
