Pages that link to "Item:Q2329678"
From MaRDI portal
The following pages link to A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints (Q2329678):
Displaying 6 items.
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues (Q2112679) (← links)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint (Q2701425) (← links)
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program (Q5038154) (← links)
- Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications (Q6180358) (← links)
