Pages that link to "Item:Q742292"

The following pages link to Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292):

Displaying 8 items.

• Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← 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 convex quadratic programs with linear complementarity constraints (Q2329678) (← links)
• New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
• Completely positive reformulations for polynomial optimization (Q2349130) (← links)
• A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint (Q2701425) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint (Q6170034) (← links)