n-step quadratic convergence of the MPRP method with a restart strategy
From MaRDI portal
(Redirected from Publication:633952)
\(n\)-step quadratic convergence of the MPRP method with a restart strategy
\(n\)-step quadratic convergence of the MPRP method with a restart strategy
Recommendations
- Global convergence of a modified PRP conjugate gradient method and its numerical results
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method
- A modified PRP conjugate gradient method
- A modified Polak-Ribière-Polyak descent method for unconstrained optimization
- Global convergence of a modified PRP conjugate gradient method
Cites work
- scientific article; zbMATH DE number 992790 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3439906 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A globally convergent version of the Polak-Ribière conjugate gradient method
- A survey of nonlinear conjugate gradient methods
- A three-parameter family of nonlinear conjugate gradient methods
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- Convergence properties of the Beale-Powell restart algorithm
- Die Konvergenzordnung des Fletcher-Powell-Algorithmus
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Linear Convergence of the Conjugate Gradient Method
- Methods of conjugate gradients for solving linear systems
- On restart procedures for the conjugate gradient method
- On the limited memory BFGS method for large scale optimization
- On the rate of superlinear convergence of a class of variable metric methods
- Optimization. Algorithms and consistent approximations
- Rate of Convergence of Several Conjugate Gradient Algorithms
- Restart procedures for the conjugate gradient method
- Some convergence properties of the conjugate gradient method
- The conjugate gradient method in extremal problems
Cited in
(10)- Rate of convergence of a restarted CG-DESCENT method
- The Hager-Zhang conjugate gradient algorithm for large-scale nonlinear equations
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- A new method with sufficient descent property for unconstrained optimization
- \(n\)-step quadratic convergence of a restart Liu-Storey type method
- The convergence rate of a restart MFR conjugate gradient method with inexact line search
- The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- A practical PR+ conjugate gradient method only using gradient
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
This page was built for publication: \(n\)-step quadratic convergence of the MPRP method with a restart strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633952)
