A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming

DOI10.1007/BF02006262zbMath0802.90098OpenAlexW2005635773MaRDI QIDQ1327826

Xiao-Dong Hu, Ji-ye Han

Publication date: 12 December 1994

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

Kuhn-Tucker pointreduced gradient algorithms

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A superlinearly convergent method to linearly constrained optimization problems under degeneracy
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• Dealing with degeneracy in reduced gradient algorithms
• Least-index resolution of degeneracy in quadratic programming
• New Finite Pivoting Rules for the Simplex Method
• The general quadratic optimization problem
• A Technique for Resolving Degeneracy in Linear Programming
• The Convex Simplex Method
• Optimality and Degeneracy in Linear Programming