A MODIFIED PROJECTED CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION PROBLEMS
From MaRDI portal
Publication:2851122
DOI10.1017/S1446181113000084zbMath1274.90384OpenAlexW2125446414MaRDI QIDQ2851122
Songhai Deng, Zhong Wan, Shuai Huang
Publication date: 9 October 2013
Published in: The ANZIAM Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1446181113000084
Optimal statistical designs (62K05) Nonlinear programming (90C30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (4)
An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems ⋮ An extended nonmonotone line search technique for large-scale unconstrained optimization ⋮ Empirical analysis and optimization of capital structure adjustment ⋮ A LOCALLY SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS
Uses Software
Cites Work
- Sufficient descent directions in unconstrained optimization
- New spectral PRP conjugate gradient method for unconstrained optimization
- A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search
- Guaranteed descent conjugate gradient methods with modified secant condition
- Convergence property of the Fletcher-Reeves conjugate gradient method with errors
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Testing Unconstrained Optimization Software
- Function minimization by conjugate gradients
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
This page was built for publication: A MODIFIED PROJECTED CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION PROBLEMS
