Convergence properties of a class of reduced gradient algorithms in linearly constrained minimization

DOI10.1080/02331939108843643zbMath0718.90085OpenAlexW2091805266MaRDI QIDQ5750732

Marco Gaviano

Publication date: 1991

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939108843643

zbMATH Keywords

global convergencereduced gradient algorithmKuhn-Tucker points

Mathematics Subject Classification ID

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