A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches
From MaRDI portal
Publication:668235
DOI10.1016/J.AMC.2015.07.019zbMATH Open1410.90203OpenAlexW937190428MaRDI QIDQ668235FDOQ668235
Authors: Mohd Rivaie, Mustafa Mamat, Abdelrhaman Abashar 
Publication date: 18 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.07.019
Recommendations
- scientific article; zbMATH DE number 1092181
- scientific article; zbMATH DE number 2163982
- A new classical conjugate gradient coefficient with exact line search
- A new class of conjugate gradient methods with extended nonmonotone line search
- A new class of mixed conjugate gradient method with exact line search
- Numerical simulations of some nonlinear conjugate gradient methods with inexact line searches
- A class of mixed conjugate gradient methods with inexact line search
- scientific article; zbMATH DE number 1022806
- A new class of nonlinear conjugate gradient coefficients for unconstrained optimization
- A new class of nonlinear conjugate gradient coefficients with global convergence properties
Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)
Cites Work
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Function minimization by conjugate gradients
- Title not available (Why is that?)
- An unconstrained optimization test functions collection
- Title not available (Why is that?)
- Restart procedures for the conjugate gradient method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Convergence Conditions for Ascent Methods
- Methods of conjugate gradients for solving linear systems
- Efficient generalized conjugate gradient algorithms. I: Theory
- Efficient hybrid conjugate gradient techniques
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Title not available (Why is that?)
- A conjugate gradient method with descent direction for unconstrained optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- Title not available (Why is that?)
- On Steepest Descent
- The convergence of conjugate gradient method with nonmonotone line search
- A spectral conjugate gradient method for unconstrained optimization
- Convergence Properties of Algorithms for Nonlinear Optimization
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
- Two modified HS type conjugate gradient methods for unconstrained optimization problems
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization
- New line search methods for unconstrained optimization
- A new family of conjugate gradient methods
- A new class of nonlinear conjugate gradient coefficients with global convergence properties
- Title not available (Why is that?)
- Global convergence of conjugate gradient methods without line search
Cited In (19)
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
- A modified form of conjugate gradient method for unconstrained optimization problems
- Hybrid random batch idea and nonlinear conjugate gradient method for accelerating charged polymer dynamics simulation
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- A new class of nonlinear conjugate gradient method for unconstrained optimization models and its application in portfolio selection
- Some three-term conjugate gradient methods with the inexact line search condition
- Flow search approach and new bounds for the \(m\)-step linear conjugate gradient algorithm
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
- A new conjugate gradient coefficient for large scale nonlinear unconstrained optimization
- Optimization of unconstrained problems using a developed algorithm of spectral conjugate gradient method calculation
- New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems.
- Title not available (Why is that?)
- A new classical conjugate gradient coefficient with exact line search
- A new conjugate gradient coefficient for unconstrained optimization
- Comments on a new class of nonlinear conjugate gradient coefficients with global convergence properties
- A new class of nonlinear conjugate gradient coefficients for unconstrained optimization
- A new class of nonlinear conjugate gradient coefficients with global convergence properties
- The proof of sufficient descent condition for a new type of conjugate gradient methods
Uses Software
This page was built for publication: A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668235)
