Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems

DOI10.1155/2014/921364zbMath1474.90519OpenAlexW1995202205WikidataQ59042846 ScholiaQ59042846MaRDI QIDQ1725277

Zhi-feng Dai

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/921364

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (2)

Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme ⋮ A novel projected Fletcher‐Reeves conjugate gradient approach for finite‐time optimal robust controller of linear constraints optimization problem: Application to bipedal walking robots

Uses Software

• SCALCG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Measuring and forecasting volatility in Chinese stock market using HAR-CJ-M model
• Nonlinear conjugate gradient methods with Wolfe type line search
• An LMI approach for dynamics of switched cellular neural networks with mixed delays
• Dynamics analysis of a class of delayed economic model
• An extension of the Fletcher-Reeves method to linear equality constrained optimization problem
• Remarks on the convergence of Rosen's gradient projection method
• Two modified HS type conjugate gradient methods for unconstrained optimization problems
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• Test example for nonlinear programming codes
• Asymptotic behavior for third-order quasi-linear differential equations
• The effects of prior outcomes on risky choice: evidence from the stock market
• Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
• Global convergence of Rosen's gradient projection method
• Sufficient conditions for non-Bazilevič functions
• A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
• Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• Investors' risk preference characteristics based on different reference point
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• Spectral gradient methods for linearly constrained optimization
• On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
• A convergence theorem of Rosen’s gradient projection method
• A class of derivative-free methods for large-scale nonlinear monotone equations
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
• A COPULA-BASED CORRELATION MEASURE AND ITS APPLICATION IN CHINESE STOCK MARKET
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A Two-Term PRP-Based Descent Method
• The conjugate gradient method in extremal problems
• A computational comparison of some non-linear programs

This page was built for publication: Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems