Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10589-023-00485-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10589-023-00485-0 / rank | |||
Normal rank | |||
Latest revision as of 19:04, 30 December 2024
scientific article; zbMATH DE number 7722198
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints |
scientific article; zbMATH DE number 7722198 |
Statements
Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (English)
0 references
3 August 2023
0 references
separable nonconvex quadratic program
0 references
Lagrangian breakpoint search
0 references
successive convex optimization
0 references
convex relaxation
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
