Convergence properties of a class of reduced gradient algorithms in linearly constrained minimization
From MaRDI portal
Publication:5750732
DOI10.1080/02331939108843643zbMath0718.90085OpenAlexW2091805266MaRDI QIDQ5750732
Publication date: 1991
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939108843643
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of reduced gradient type (90C52) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general convergence theorem for the reduced gradient method
- On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems
- Conjugate gradient methods for linearly constrained nonlinear programming
- Large-scale linearly constrained optimization
This page was built for publication: Convergence properties of a class of reduced gradient algorithms in linearly constrained minimization