An example of cycling in a feasible point algorithm (Q3912363): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4770783 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Composite Simplex Algorithm / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01589358 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998558841 / rank | |||
Normal rank | |||
Latest revision as of 08:37, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An example of cycling in a feasible point algorithm |
scientific article |
Statements
An example of cycling in a feasible point algorithm (English)
0 references
1981
0 references
cycling
0 references
feasible point algorithm
0 references
active set
0 references
linear constraints
0 references
