Computer Algebra and Line Search
From MaRDI portal
Publication:3086910
DOI10.1007/978-1-4419-6594-3_28zbMath1215.65112OpenAlexW56741150MaRDI QIDQ3086910
Marko B. Miladinović, Predrag S. Stanimirović, Ivan M. Jovanović
Publication date: 30 March 2011
Published in: Approximation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-6594-3_28
numerical examplesconjugate gradient methodNewton methodcomputer algebra systemgradient descent methodline searchunconstrained nonlinear optimization methods
Uses Software
Cites Work
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Stepsize analysis for descent methods
- Convergence of line search methods for unconstrained optimization
- Efficent line search algorithm for unconstrained optimization
- A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
- Optimization theory and methods. Nonlinear programming
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- Minimization of functions having Lipschitz continuous first partial derivatives
- Convergence Conditions for Ascent Methods
- On Steepest Descent
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computer Algebra and Line Search
