Computer Algebra and Line Search
From MaRDI portal
Recommendations
Cites work
- A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- An unconstrained optimization test functions collection
- Convergence Conditions for Ascent Methods
- Convergence of line search methods for unconstrained optimization
- Efficent line search algorithm for unconstrained optimization
- scientific article; zbMATH DE number 3718477 (Why is no real title available?)
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1292563 (Why is no real title available?)
- scientific article; zbMATH DE number 1493092 (Why is no real title available?)
- scientific article; zbMATH DE number 194926 (Why is no real title available?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- On Steepest Descent
- Optimization theory and methods. Nonlinear programming
- Stepsize analysis for descent methods
This page was built for publication: Computer Algebra and Line Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086910)