Practical convergence conditions for unconstrained optimization
From MaRDI portal
Cites work
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- A Rapidly Convergent Descent Method for Minimization
- An effective algorithm for minimization
- Comparison of some conjugate direction procedures for function minimization
- Convergence Conditions for Ascent Methods
- Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
- Function minimization by conjugate gradients
- scientific article; zbMATH DE number 3286531 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- scientific article; zbMATH DE number 3421857 (Why is no real title available?)
- Linear Convergence of the Conjugate Gradient Method
Cited in
(8)- A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications
- Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben
- A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
- Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
- Practical convergence conditions for the Davidon-Fletcher-Powell method
- Regularized step directions in nonlinear conjugate gradient methods
This page was built for publication: Practical convergence conditions for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5685870)
