A general convergence theorem for the reduced gradient method

DOI10.1007/BF01390125zbMath0512.90084OpenAlexW1995252232MaRDI QIDQ1050256

J. Blot

Publication date: 1984

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132899

zbMATH Keywords

algorithmlinear equality constraintsconvergence theoremreduced gradient methodnonnegativity bounds

Mathematics Subject Classification ID

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

Related Items (2)

On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems ⋮ Convergence properties of a class of reduced gradient algorithms in linearly constrained minimization

Cites Work

• Conjugate gradient methods for linearly constrained nonlinear programming
• Large-scale linearly constrained optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A general convergence theorem for the reduced gradient method