Pages that link to "Item:Q1970512"
From MaRDI portal
The following pages link to Strong duality for a trust-region type relaxation of the quadratic assignment problem (Q1970512):
Displaying 17 items.
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← links)
- Strong duality for generalized trust region subproblem: S-lemma with interval bounds (Q497446) (← links)
- Global optimization of a class of nonconvex quadratically constrained quadratic programming problems (Q644622) (← links)
- Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Sufficient global optimality conditions for bivalent quadratic optimization (Q702386) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid (Q1016108) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← links)
- Strong duality for general quadratic programs with quadratic equality constraints (Q2082247) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- On Lagrangian relaxation of quadratic matrix constraints (Q2706239) (← links)
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition (Q3648528) (← links)
- Minimizing the object space error for pose estimation: towards the most efficient algorithm (Q5743218) (← links)
- A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold (Q6596339) (← links)
