Pages that link to "Item:Q365811"
From MaRDI portal
The following pages link to New semidefinite programming relaxations for box constrained quadratic program (Q365811):
Displaying 8 items.
- Relaxing the optimality conditions of box QP (Q538311) (← links)
- A feasible direction method for the semidefinite program with box constraints (Q654206) (← links)
- A class of differential quadratic programming problems (Q670795) (← links)
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
- Partially positive matrices (Q892772) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)