Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
From MaRDI portal
Publication:970585
DOI10.1007/S11075-009-9321-0zbMATH Open1192.65074OpenAlexW2081241643MaRDI QIDQ970585FDOQ970585
Recommendations
- A new hybrid conjugate gradient algorithm for unconstrained optimization
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates
- New hybrid conjugate gradient method for unconstrained optimization
- An efficient hybrid conjugate gradient method for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 992790 (Why is no real title available?)
- scientific article; zbMATH DE number 3852340 (Why is no real title available?)
- scientific article; zbMATH DE number 3494100 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 195074 (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 survey of nonlinear conjugate gradient methods
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- An efficient hybrid conjugate gradient method for unconstrained optimization
- An unconstrained optimization test functions collection
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- CUTE
- Convergence Conditions for Ascent Methods
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence result for conjugate gradient methods
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Methods of conjugate gradients for solving linear systems
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New properties of a nonlinear conjugate gradient method
- New quasi-Newton equation and related methods for unconstrained optimization
- Numerical study of a relaxed variational problem from optimal design
- On a problem of the theory of lubrication governed by a variational inequality
- On the limited memory BFGS method for large scale optimization
- Restart procedures for the conjugate gradient method
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- The conjugate gradient method in extremal problems
Cited in
(22)- Comments on ``Another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei
- An efficient hybrid conjugate gradient method for unconstrained optimization
- Comments on ``A hybrid conjugate gradient method based on a quadratic relaxation of the Dai-Yuan hybrid conjugate gradient parameter
- A hybrid conjugate gradient method based on a quadratic relaxation of the Dai-Yuan hybrid conjugate gradient parameter
- New hybrid conjugate gradient method as a convex combination of LS and FR methods
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- New hybrid conjugate gradient method for unconstrained optimization
- A hybrid Riemannian conjugate gradient method for nonconvex optimization problems
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates
- Two hybrid nonlinear conjugate gradient methods based on a modified secant equation
- A hybridization of the Hestenes-Stiefel and Dai-Yuan conjugate gradient methods based on a least-squares approach
- Two modified scaled nonlinear conjugate gradient methods
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique
- A class of accelerated conjugate-gradient-like methods based on a modified secant equation
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization
- A conjugate gradient method based on a modified secant relation for unconstrained optimization
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
- An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization
This page was built for publication: Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970585)
