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
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Max-AO / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CirCut / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPLR / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1990735605 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:19, 19 March 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
