On verified numerical computations in convex programming (Q849186)
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 5674924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On verified numerical computations in convex programming |
scientific article; zbMATH DE number 5674924 |
Statements
On verified numerical computations in convex programming (English)
0 references
25 February 2010
0 references
linear programming
0 references
semidefinite programming
0 references
conic programming
0 references
convex programming
0 references
combinatorial optimization
0 references
rounding errors
0 references
ill-posed problems
0 references
interval arithmetic
0 references
branch-bound-and-cut
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.88526344
0 references
0.8818069
0 references
0.8792752
0 references
0.8771654
0 references
0.87622315
0 references
0.8716028
0 references
0.8709701
0 references
0.8690472
0 references
0.8672665
0 references
