An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems (Q6509026)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems |
scientific article from arXiv |
Statements
An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems (English)
0 references
