Solving quadratically constrained convex optimization problems with an interior-point method (Q3093053)
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 5957066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving quadratically constrained convex optimization problems with an interior-point method |
scientific article; zbMATH DE number 5957066 |
Statements
Solving quadratically constrained convex optimization problems with an interior-point method (English)
0 references
12 October 2011
0 references
interior-point methods
0 references
convex optimization
0 references
quadratic programming
0 references
0 references
0 references
0 references
0.8399306535720825
0 references
0.8022519946098328
0 references
0.7996878027915955
0 references
0.7975850701332092
0 references
0.7930005788803101
0 references
