Pages that link to "Item:Q3693274"
From MaRDI portal
The following pages link to A fast and robust unconstrained optimization method requiring minimum storage (Q3693274):
Displaying 7 items.
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b) (Q799347) (← links)
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints (Q985699) (← links)
- A conjugate direction gradient method with reconnaissance steps for unconstrained minimization (Q1113622) (← links)
- A convergent dynamic method for large minimization problems (Q1124283) (← links)
- An algorithm for solving sparse nonlinear least squares problems (Q1822462) (← links)
- Vectorization of conjugate-gradient methods for large-scale minimization in meteorology (Q1823863) (← links)
- A conjugate gradient method with quasi-Newton approximation (Q4522997) (← links)