A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777)
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; zbMATH DE number 7712188
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time infeasible interior-point arc-search algorithm for convex optimization |
scientific article; zbMATH DE number 7712188 |
Statements
A polynomial time infeasible interior-point arc-search algorithm for convex optimization (English)
0 references
13 July 2023
0 references
infeasible interior-point algorithm
0 references
arc-search
0 references
convex optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8294403553009033
0 references
0.7881215214729309
0 references
0.7825906872749329
0 references
0.7800769805908203
0 references
