A unified approach to the feasible direction methods for nonlinear programming with linear constraints (Q1058461)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A unified approach to the feasible direction methods for nonlinear programming with linear constraints |
scientific article; zbMATH DE number 3900521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A unified approach to the feasible direction methods for nonlinear programming with linear constraints |
scientific article; zbMATH DE number 3900521 |
Statements
A unified approach to the feasible direction methods for nonlinear programming with linear constraints (English)
0 references
1984
0 references
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.
0 references
general algorithmic model
0 references
convergence analysis
0 references
linear constraints
0 references
feasible direction method
0 references
0.9239443
0 references
0.9229653
0 references
