A three-term conjugate gradient method with accelerated subspace quadratic optimization
From MaRDI portal
Publication:2089194
Cites work
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A new efficient conjugate gradient method for unconstrained optimization
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A survey of nonlinear conjugate gradient methods
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- CUTE
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Line search algorithms with guaranteed sufficient decrease
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- On the limited memory BFGS method for large scale optimization
- The conjugate gradient method in extremal problems
- The Limited Memory Conjugate Gradient Method
Cited in
(5)- Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems
- A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization
- An improved Dai-Liao-style hybrid conjugate gradient-based method for solving unconstrained nonconvex optimization and extension to constrained nonlinear monotone equations
- Two hybrid conjugate gradient based algorithms on Riemannian manifolds with adaptive restart strategy for nonconvex optimization problems
- A hybrid-inertial accelerated spectral CG projection method with restart mechanism and its application to compressed sensing
This page was built for publication: A three-term conjugate gradient method with accelerated subspace quadratic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089194)