Pages that link to "Item:Q3169131"
From MaRDI portal
The following pages link to On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming (Q3169131):
Displaying 16 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← links)
- The generalized trust region subproblem (Q457202) (← links)
- Characterizing \(\mathbf Q\)-linear transformations for semidefinite linear complementarity problems (Q654083) (← links)
- Simplified semidefinite and completely positive relaxations (Q1785437) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem (Q2454077) (← links)
- Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem (Q2706327) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint (Q4653548) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
- Linear Programming on the Stiefel Manifold (Q6202765) (← links)
