Generalization of primal-dual interior-point methods to convex optimization problems in conic form (Q5945646)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalization of primal-dual interior-point methods to convex optimization problems in conic form |
scientific article; zbMATH DE number 1657336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalization of primal-dual interior-point methods to convex optimization problems in conic form |
scientific article; zbMATH DE number 1657336 |
Statements
Generalization of primal-dual interior-point methods to convex optimization problems in conic form (English)
0 references
14 October 2001
0 references
self-concordant barriers
0 references
symmetric cones
0 references
polynomial iteration-complexity
0 references
variable metric methods
0 references
primal-dual interior-point methods
0 references
linear programming
0 references
convex optimization
0 references
quasi-Newton methods
0 references
0.8590710163116455
0 references
0.8590710163116455
0 references
0.8356699347496033
0 references
0.8243343830108643
0 references
0.8215856552124023
0 references
