One modification of the logarithmic barrier function method in linear and convex programming (Q735653): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3673541 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4415236 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3797760 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5588268 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The multiplier method of Hestenes and Powell applied to convex programming / rank | |||
Normal rank | |||
Latest revision as of 01:42, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One modification of the logarithmic barrier function method in linear and convex programming |
scientific article |
Statements
One modification of the logarithmic barrier function method in linear and convex programming (English)
0 references
23 October 2009
0 references
