Pages that link to "Item:Q2536596"
From MaRDI portal
The following pages link to Numerical experiments on quadratically convergent algorithms for function minimization (Q2536596):
Displaying 16 items.
- Computational experience with Davidon's least-square algorithm (Q754620) (← links)
- Quasi-Newton methods for saddlepoints (Q762890) (← links)
- Conditions for variable-metric algorithms to be conjugate-gradient algorithms (Q1173014) (← links)
- Variable metric methods in Hilbert space with applications to control problems (Q1218146) (← links)
- Numerical experiments on DFP-method, a powerful function minimization technique (Q1221477) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Computational performance of Huang's symmetric update for the conjugate gradient method (Q1844531) (← links)
- On variable-metric algorithms (Q2541844) (← links)
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions (Q2549166) (← links)
- Unconstrained approach to the extremization of constrained functions (Q2553077) (← links)
- Quadratically convergent algorithms and one-dimensional search schemes (Q2553146) (← links)
- On the uniqueness of search directions in variable metric algorithms (Q2555452) (← links)
- Method of dual matrices for function minimization (Q2560773) (← links)
- Numerical experiments on dual matrix algorithms for function minimization (Q2560774) (← links)
- On the convergence of variable-metric methods (Q2561469) (← links)
