A unified approach to the feasible direction methods for nonlinear programming with linear constraints
type: Item
instance of: scholarly article
title: A unified approach to the feasible direction methods for nonlinear programming with linear constraints
zbMATH Open document ID: 0564.90064
DOI: 10.1007/BF01883894
author: Minyi Yue
author: Jiye Han
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 1984-01-01T00:00:00Z
review text: We introduce an algorithm with parameters for solving nonlinear programming problems with linear constraints. The algorithm is of the feasible direction method type. It is convergent under rather simple conditions. When these parameters are specified, we have many well-known algorithms as its special cases. Still more, many new algorithms can be derived from this general model.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3900521
zbMATH Keywords: general algorithmic model
zbMATH Keywords: convergence analysis
zbMATH Keywords: linear constraints
zbMATH Keywords: feasible direction method
MaRDI profile type: Publication
cites work: Convergence Conditions for Nonlinear Programming Algorithms
cites work: Q5603731
cites work: Q3206668
cites work: Q5187086
cites work: Q3932576
cites work: Q3308648
cites work: The Convex Simplex Method
cites work: Q3953574
cites work: Q3351160
full work available at URL: https://doi.org/10.1007/bf01883894
OpenAlex ID: W2011685760
Recommended article: Q3734176
Recommended article: Q4025423
Recommended article: Q4707328
Recommended article: Q4271719
Recommended article: Q3477899
Recommended article: Q3783851
Recommended article: Q3982524
Recommended article: Q5187086
Recommended article: A feasible directions method on combining feasibility with descent for nonlinear constrained optimization
Recommended article: A feasible direction method for linear programming
description: scientific article; zbMATH DE number 3900521