An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
From MaRDI portal
Recommendations
- A spectral conjugate gradient method for unconstrained optimization
- A descent spectral conjugate gradient algorithm for unconstrained optimization
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- A modified spectral conjugate gradient method for solving unconstrained minimization problems
- scientific article; zbMATH DE number 7663620
- A spectral-type conjugate gradient method for nonsmooth convex minimization
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- New spectral LS conjugate gradient method for nonlinear unconstrained optimization
- Two spectral conjugate gradient methods for unconstrained optimization problems
- A class of improved conjugate gradient methods for nonconvex unconstrained optimization
Cites work
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A conjugate gradient method with descent direction for unconstrained optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search
- A survey of nonlinear conjugate gradient methods
- Algorithm 851
- An unconstrained optimization test functions collection
- CUTE
- Further insight into the Shamanskii modification of Newton method
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Global convergence of a modified spectral FR conjugate gradient method
- Global convergence of a modified spectral conjugate gradient method
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New spectral PRP conjugate gradient method for unconstrained optimization
- Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
- Scaled conjugate gradient algorithms for unconstrained optimization
- Spectral gradient projection method for solving nonlinear monotone equations
Cited in
(21)- A new nonmonotone line search technique for unconstrained optimization
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- Optimization model and solution method for dynamically correlated two-product newsvendor problems based on copula
- scientific article; zbMATH DE number 7663620 (Why is no real title available?)
- Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems
- A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
- A class of modified non-monotonic spectral conjugate gradient method and applications to non-negative matrix factorization
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
- New spectral LS conjugate gradient method for nonlinear unconstrained optimization
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering
- A locally smoothing method for mathematical programs with complementarity constraints
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization
- Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- A new family of conjugate gradient methods for unconstrained optimization
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- Accelerated inexact composite gradient methods for nonconvex spectral optimization problems
- A descent hybrid modification of the Polak-Ribière-Polyak conjugate gradient method
This page was built for publication: An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364742)
