Pages that link to "Item:Q5661719"
From MaRDI portal
The following pages link to Methods of conjugate directions versus quasi-Newton methods (Q5661719):
Displayed 12 items.
- A quasi-Newton method with Cholesky factorization (Q1133299) (← links)
- On the accelerating property of an algorithm for function minimization without calculating derivatives (Q1234558) (← links)
- Accelerated conjugate direction methods for unconstrained optimization (Q1236069) (← 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)
- A fast quasi-Newton method for semi-supervised SVM (Q2275982) (← links)
- Convergence conditions for restarted conjugate gradient methods with inaccurate line searches (Q4090137) (← links)
- A superlinearly convergent algorithm for minimization without evaluating derivatives (Q4093226) (← links)
- A method to accelerate the rate of convergence of a class of optimization algorithms (Q4123091) (← links)
- Matrix conditioning and nonlinear optimization (Q4147882) (← links)
- A quasi-Newton method can be obtained from a method of conjugate directions (Q4168396) (← links)
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods (Q4768565) (← links)