On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems

DOI10.1080/02331938608843192zbMath0623.65068OpenAlexW2089718574MaRDI QIDQ3761589

Klaus Schittkowski

Publication date: 1986

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

global convergenceKuhn-Tucker pointreduced gradient methodscomputational test results

Mathematics Subject Classification ID

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

Related Items (1)

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

Uses Software

• CONOPT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur la convergence théorique de la méthode du gradient reduit généralise
• A general convergence theorem for the reduced gradient method
• Multiplier methods: A survey
• Generalized reduced gradient method as an extension of feasible direction methods
• Multiplier and gradient methods
• On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
• Efficiently Converging Minimization Methods Based on the Reduced Gradient
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming

This page was built for publication: On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems