An example of cycling in a feasible point algorithm (Q3912363): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
Revision as of 12:29, 13 June 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