Remarks on the convergence of Rosen's gradient projection method

DOI10.1007/BF02007671zbMath0624.65051OpenAlexW1970984682MaRDI QIDQ578857

Ding-Zhu Du

Publication date: 1987

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02007671

zbMATH Keywords

convergenceRosen's gradient projection method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (3)

On Rosen's gradient projection methods ⋮ Rosen's gradient projection with discrete steps ⋮ Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems

Cites Work

• A unified approach to the feasible direction methods for nonlinear programming with linear constraints
• A superlinearly convergent method to linearly constrained optimization problems under degeneracy
• Enumerating rooted loopless planar maps
• Sufficient conditions for the convergence of monotonic mathematical programming algorithms
• Extensions of the continuity of point-to-set maps: Applications to fixed point algorithms
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Optimization algorithms and point-to-set-maps
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• Convergence Conditions for Nonlinear Programming Algorithms
• The Validity of a Family of Optimization Methods
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Remarks on the convergence of Rosen's gradient projection method