Pages that link to "Item:Q2315597"
From MaRDI portal
The following pages link to Recovering optimal solutions via SOC-SDP relaxation of trust region subproblem with nonintersecting linear constraints (Q2315597):
Displaying 5 items.
- A survey of hidden convex optimization (Q2176821) (← links)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- The trust region subproblem with non-intersecting linear constraints (Q2515041) (← links)
- A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts (Q2628919) (← links)
- New results on eliminating the duality gap of the second-order-cone reformulation for extended trust-region subproblem with two intersecting cuts (Q6639477) (← links)