Global convergence of Rosen's gradient projection method

DOI10.1007/BF01587098zbMath0683.90081OpenAlexW2044887224MaRDI QIDQ1825143

Ding-Zhu Du, Xiang-Sun Zhang

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

convergencegradient projectionRosen's gradient method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)

Related Items

A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems ⋮ A globally convergent primal-dual interior point algorithm for convex programming ⋮ A counterexample of the convergence of Rosen's algorithm with inexact line search ⋮ A feasible descent cone method for linearly constrained minimization problems ⋮ On Rosen's gradient projection methods ⋮ Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems ⋮ Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks ⋮ Analysis and implementation of a dual algorithm for constrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A family of gradient projection methods
• 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
• Sufficient conditions for the convergence of monotonic mathematical programming algorithms
• A convergence theorem of Rosen’s gradient projection method
• 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