Generalized reduced gradient method as an extension of feasible direction methods

DOI10.1007/BF00933163zbMath0336.65035OpenAlexW2043594040MaRDI QIDQ1230358

Yves Smeers

Publication date: 1977

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00933163

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (5)

Sur la convergence théorique de la méthode du gradient reduit généralise ⋮ Two-phase generalized reduced gradient method for constrained global optimization ⋮ On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems ⋮ Stochastic perturbation of reduced gradient \& GRG methods for nonconvex programming problems ⋮ Variants of the reduced Newton method for nonlinear equality constrained optimization problems

Cites Work

• New Methods in Mathematical Programming—Some Simplex-Like Nonlinear Programming Procedures
• The Convex Simplex Method
• On the Convergence of Gradient Methods under Constraint
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized reduced gradient method as an extension of feasible direction methods