Extension of a projective interior point method for linearly constrained convex programming (Q990634): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An extension of Karmarkar's algorithm for linear programming using dual variables / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming / rank | |||
Normal rank | |||
Latest revision as of 03:06, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extension of a projective interior point method for linearly constrained convex programming |
scientific article |
Statements
Extension of a projective interior point method for linearly constrained convex programming (English)
0 references
1 September 2010
0 references
linearly constrained convex programming
0 references
nonlinear programming
0 references
linearization methods
0 references
karmarkar's projective method
0 references
0 references
