A rigorous lower bound for the optimal value of convex optimization problems (Q1424965)
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 2057600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A rigorous lower bound for the optimal value of convex optimization problems |
scientific article; zbMATH DE number 2057600 |
Statements
A rigorous lower bound for the optimal value of convex optimization problems (English)
0 references
15 March 2004
0 references
Convex programming
0 references
Convex relaxations
0 references
Global optimization
0 references
Interval arithmetic
0 references
Large-scale problems
0 references
Quadratic programming
0 references
Rigorous error bounds
0 references
Sensitivity analysis
0 references
0.8334341645240784
0 references
0.7755076289176941
0 references
0.756604015827179
0 references
0.7537450194358826
0 references
0.7411221861839294
0 references
