An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence (Q3491323): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Max-AO / rank | |||
Normal rank |
Revision as of 20:01, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence |
scientific article |
Statements
An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence (English)
0 references
1990
0 references
primal-dual interior point algorithm
0 references
convex separable programming
0 references
linear constraints
0 references
Karush-Kuhn-Tucker conditions
0 references