Pages that link to "Item:Q2689857"
From MaRDI portal
The following pages link to New bounds for nonconvex quadratically constrained quadratic programming (Q2689857):
Displaying 8 items.
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- New IQC for quasi-concave nonlinearities. (Q2730988) (← links)
- Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints (Q2768043) (← links)
- New results on semidefinite bounds for<i>ℓ</i><sub>1</sub>-constrained nonconvex quadratic optimization (Q5397701) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q6314518) (← links)