Pages that link to "Item:Q2448210"

The following pages link to Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization (Q2448210):

Displaying 9 items.

• SDP reformulation for robust optimization problems based on nonconvex QP duality (Q354630) (← links)
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
• On the complexity of finding stationary points of nonconvex quadratic programs (Q1272568) (← links)
• Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints (Q1785385) (← links)
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
• A new semidefinite relaxation for \(L_{1}\)-constrained quadratic (Q2353474) (← links)
• Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141) (← links)
• New results on semidefinite bounds for<i>ℓ</i>₁-constrained nonconvex quadratic optimization (Q5397701) (← links)