On Rosen's gradient projection methods
From MaRDI portal
Publication:917449
DOI10.1007/BF02216813zbMath0704.90081OpenAlexW1973887314MaRDI QIDQ917449
Fang Wu, Xiang-Sun Zhang, Ding-Zhu Du
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02216813
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
A counterexample of the convergence of Rosen's algorithm with inexact line search ⋮ A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
Cites Work
- Remarks on the convergence of Rosen's gradient projection method
- A superlinearly convergent method to linearly constrained optimization problems under degeneracy
- Global convergence of Rosen's gradient projection method
- A convergence theorem of Rosen’s gradient projection method
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- 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
This page was built for publication: On Rosen's gradient projection methods