A new method for solving unconstrained optimization problems
From MaRDI portal
Recommendations
- A new conjugate gradient method for unconstrained optimization
- A new conjugate gradient method for nonlinear unconstrained optimization problems
- A new conjugate gradient method for unconstrained optimization
- The convergence properties of some new conjugate gradient methods
- scientific article; zbMATH DE number 5927317
Cited in
(15)- Method of ``cleft-overstep by prependicular direction for solving the unconstrained nonlinear optimization problem
- New line search methods for unconstrained optimization
- Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods
- A new conjugate gradient method for nonlinear unconstrained optimization problems
- A new conjugate gradient coefficient for unconstrained optimization
- A new conjugate gradient method for unconstrained optimization
- scientific article; zbMATH DE number 5631038 (Why is no real title available?)
- A fast and robust unconstrained optimization method requiring minimum storage
- scientific article; zbMATH DE number 44981 (Why is no real title available?)
- An algorithm for unconstrained optimization
- scientific article; zbMATH DE number 1424368 (Why is no real title available?)
- A new solving procedure by m-M calculus for problems of constrained optimization
- A new unidimensional search method for optimization: the 5/9 method
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- The convergence properties of some new conjugate gradient methods
This page was built for publication: A new method for solving unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3631594)
