A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems
From MaRDI portal
Publication:3016307
DOI10.1080/01630563.2011.554948zbMath1230.65068OpenAlexW2053373194MaRDI QIDQ3016307
Publication date: 15 July 2011
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2011.554948
unconstrained optimizationglobal convergencenumerical resultsline searchtrust regionsearch directionConjugate gradient
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ A novel value for the parameter in the Dai-Liao-type conjugate gradient method ⋮ A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Convergence analysis of a modified BFGS method on convex minimizations
- A conjugate gradient method with descent direction for unconstrained optimization
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- The convergence properties of some new conjugate gradient methods
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
- A conjugate gradient method for unconstrained optimization problems
- A note about WYL's conjugate gradient method and its applications
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- A modified PRP conjugate gradient method
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search
- Convergence of line search methods for unconstrained optimization
- New line search methods for unconstrained optimization
- A new family of conjugate gradient methods
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Two-Point Step Size Gradient Methods
- Testing Unconstrained Optimization Software
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Numerical Optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- CUTEr and SifDec
- Hybrid conjugate gradient methods for unconstrained optimization
- A modified BFGS method and its global convergence in nonconvex minimization
- Benchmarking optimization software with performance profiles.
