Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
From MaRDI portal
Recommendations
- A hybrid nonlinear conjugate gradient method for unconstrained optimization problems
- scientific article; zbMATH DE number 5927317
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- A new conjugate gradient method for nonlinear unconstrained optimization problems
Cited in
(74)- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues
- A new family of conjugate gradient methods for unconstrained optimization
- Two adaptive Dai-Liao nonlinear conjugate gradient methods
- Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations
- Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations
- Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations
- Descent Perry conjugate gradient methods for systems of monotone nonlinear equations
- A novel value for the parameter in the Dai-Liao-type conjugate gradient method
- A class of accelerated subspace minimization conjugate gradient methods
- An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation
- New investigation for the Liu-Story scaled conjugate gradient method for nonlinear optimization
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
- An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix
- A new hybrid algorithm for convex nonlinear unconstrained optimization
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- Descent symmetrization of the Dai-Liao conjugate gradient method
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition
- A modified scaling parameter for the memoryless BFGS updating formula
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
- A new class of nonlinear conjugate gradient coefficients with global convergence properties
- Global convergence of a modified spectral conjugate gradient method
- A new conjugate gradient algorithm with cubic Barzilai-Borwein stepsize for unconstrained optimization
- A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice
- A modified Hestense-Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method
- Two modified three-term conjugate gradient methods with sufficient descent property
- Matrix analyses on the Dai-Liao conjugate gradient method
- A new type of descent conjugate gradient method with exact line search
- A hybrid scaling parameter for the scaled memoryless BFGS method based on the _ matrix norm
- Improving the Dai-Liao parameter choices using a fixed point equation
- On optimality of two adaptive choices for the parameter of Dai-Liao method
- A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update
- A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function
- New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters
- An efficient hybrid conjugate gradient method for unconstrained optimisation
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
- Two families of hybrid conjugate gradient methods with restart procedures and their applications
- Optimization of unconstrained problems using a developed algorithm of spectral conjugate gradient method calculation
- A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems
- On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications
- A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems
- A restart scheme for the memoryless BFGS method
- A Five-Parameter Class of Derivative-Free Spectral Conjugate Gradient Methods for Systems of Large-Scale Nonlinear Monotone Equations
- On two symmetric Dai-Kou type schemes for constrained monotone equations with image recovery application
- Another Hager-Zhang-type method via singular-value study for constrained monotone equations with application
- A family of accelerated hybrid conjugate gradient method for unconstrained optimization and image restoration
- Three-term Hager-Zhang projection method for monotone nonlinear equations
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches
- An improved spectral CG method based on Dai–Liao conjugacy condition and quasi-Newton direction
- An accelerated gradient descent method based on a non-monotone backtracking line search scheme for unconstrained optimization and image restoration problems.
- An augmented memoryless Davidon–Fletcher–Powell method based on the Dai–Liao approach
- Solving an augmented nonnegative matrix factorization model by modified scaled nonmonotone memoryless BFGS methods devised based on the ellipsoid vector norm
- Two RMIL-type schemes with compressed sensing applications
- Derivative-free projection CG-based algorithm with restart strategy for solving convex-constrained nonlinear monotone equations and its application to logistic regression
- A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization
- An inertial Dai-Liao conjugate method for convex constrained monotone equations that avoids the direction of maximum magnification
- On solving a revised model of the nonnegative matrix factorization problem by the modified adaptive versions of the Dai-Liao method
- Two hybrid conjugate gradient based algorithms on Riemannian manifolds with adaptive restart strategy for nonconvex optimization problems
- Improved Dai-Yuan iterative schemes for convex constrained monotone nonlinear systems
- The Dai-Liao conjugate gradient method with strong convergence and its application in image restoration and machine learning
- Descent four-term Dai-Liao-type scheme for constrained monotone equations and image de-blurring
- A restart derivative-free algorithm for solving pseudomonotone equations
- Restarting two-term nonlinear conjugate gradient methods based on a finite precision arithmetic analysis
- On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae
This page was built for publication: Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q538032)
