A unified approach to the feasible direction methods for nonlinear programming with linear constraints

DOI10.1007/BF01883894zbMath0564.90064OpenAlexW2011685760MaRDI QIDQ1058461

Minyi Yue, Ji-ye Han

Publication date: 1984

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

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

zbMATH Keywords

convergence analysislinear constraintsfeasible direction methodgeneral algorithmic model

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (3)

Remarks on the convergence of Rosen's gradient projection method ⋮ A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties ⋮ Global convergence of Rosen's gradient projection method

Cites Work

• The Convex Simplex Method
• Convergence Conditions for Nonlinear Programming Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A unified approach to the feasible direction methods for nonlinear programming with linear constraints