A new infeasible-interior-point algorithm for linear programming over symmetric cones (Q2401787): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10255-017-0697-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2743157128 / rank | |||
Normal rank | |||
Revision as of 01:13, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new infeasible-interior-point algorithm for linear programming over symmetric cones |
scientific article |
Statements
A new infeasible-interior-point algorithm for linear programming over symmetric cones (English)
0 references
5 September 2017
0 references
symmetric cone
0 references
Euclidean Jordan algebra
0 references
interior-point methods
0 references
linear programming
0 references
polynomial complexity
0 references
