A modified projected conjugate gradient algorithm for unconstrained optimization problems

DOI10.1017/S1446181113000084MaRDI QIDQ2851122zbMATH OpenOpenAlexFDO

Authors Shuai Huang, Zhong Wan, Songhai Deng

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

zbMATH Keywords

global convergencemodified conjugacy conditionprojected methodPRP method

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Nonlinear programming (90C30)

Recommendations

• A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems
• Global convergence of a modified PRP conjugate gradient method and its numerical results
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
• An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence

Cites work

• 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
• Convergence property of the Fletcher-Reeves conjugate gradient method with errors
• Function minimization by conjugate gradients
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• Guaranteed descent conjugate gradient methods with modified secant condition
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• New spectral PRP conjugate gradient method for unconstrained optimization
• Sufficient descent directions in unconstrained optimization
• Testing Unconstrained Optimization Software
• The conjugate gradient method in extremal problems

Cited in

(8)

• An extended nonmonotone line search technique for large-scale unconstrained optimization
• An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem
• Empirical analysis and optimization of capital structure adjustment
• Some modified conjugate gradient methods for unconstrained optimization
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
• An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
• A locally smoothing method for mathematical programs with complementarity constraints
• A modified PRP conjugate gradient method for unconstrained optimization and nonlinear equations

Describes a project that uses

Uses Software

• minpack

This page was built for publication: A modified projected conjugate gradient algorithm for unconstrained optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851122)