A simplicial branch-and-bound method for solving nonconvex all-quadratic programs (Q1281481): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1008377529330 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1859065560 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:01, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simplicial branch-and-bound method for solving nonconvex all-quadratic programs |
scientific article |
Statements
A simplicial branch-and-bound method for solving nonconvex all-quadratic programs (English)
0 references
21 July 1999
0 references
global optimization
0 references
indefinite quadratic optimization under indefinite quadratic constraints
0 references
nonconvex quadratically constrained quadratic programs
0 references
branch-and-bound
0 references
\(\varepsilon\)-approximate optimal solution
0 references
