A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties

DOI10.1007/BF02216819zbMath0738.90069OpenAlexW2015417145MaRDI QIDQ1813345

Xiao-Dong Hu, Jin Liu, Ji-ye Han

Publication date: 25 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

global convergencedegeneracyconvex analysisfeasible point algorithmslinear constrintspivoting operation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified approach to the feasible direction methods for nonlinear programming with linear constraints
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• A convergence theorem of Rosen’s gradient projection method
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Dealing with degeneracy in reduced gradient algorithms
• New Finite Pivoting Rules for the Simplex Method
• A Technique for Resolving Degeneracy in Linear Programming
• The Convex Simplex Method
• Quasi-Newton Methods and their Application to Function Minimisation
• Optimality and Degeneracy in Linear Programming

This page was built for publication: A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties