A rigorous lower bound for the optimal value of convex optimization problems (Q1424965): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/b:jogo.0000006720.68398.8c / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973594390 / rank | |||
Normal rank | |||
Revision as of 08:56, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A rigorous lower bound for the optimal value of convex optimization problems |
scientific article |
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
