Pages that link to "Item:Q2031320"
From MaRDI portal
The following pages link to An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320):
Displaying 4 items.
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues (Q2112679) (← links)
- On globally solving the extended trust-region subproblems (Q2661497) (← links)
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program (Q5038154) (← links)
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints (Q6534829) (← links)