Efficient methods for solving convex programming problems that apply the embedding of the admissible set into simplices (Q3115685)
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: Efficient methods for solving convex programming problems that apply the embedding of the admissible set into simplices |
scientific article; zbMATH DE number 6004945
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient methods for solving convex programming problems that apply the embedding of the admissible set into simplices |
scientific article; zbMATH DE number 6004945 |
Statements
10 February 2012
0 references
system of linear inequalities
0 references
block matrix
0 references
0.8220915198326111
0 references
0.8132416605949402
0 references
0.8083390593528748
0 references
0.8083051443099976
0 references
