A general convergence theorem for the reduced gradient method

DOI10.1007/BF01390125MaRDI QIDQ1050256zbMATH OpenOpenAlexFDO

Authors 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

algorithmconvergence theoremlinear equality constraintsnonnegativity boundsreduced gradient method

Mathematics Subject Classification ID

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

Cites work

• Conjugate gradient methods for linearly constrained nonlinear programming
• scientific article; zbMATH DE number 3932322 (Why is no real title available?)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3506456 (Why is no real title available?)
• Large-scale linearly constrained optimization

Cited in

(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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1050256)