Pages that link to "Item:Q4864871"
From MaRDI portal
The following pages link to Convex Relaxations of (0, 1)-Quadratic Programming (Q4864871):
Displaying 22 items.
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Using the eigenvalue relaxation for binary least-squares estimation problems (Q839052) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- On solving trust-region and other regularised subproblems in optimization (Q977328) (← links)
- A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
- Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
- Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868) (← links)
- A continuation approach for solving binary quadratic program based on a class of NCP-functions (Q2344687) (← links)
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables (Q2423781) (← links)
- On the indefinite quadratic bilevel programming problem. (Q2477129) (← links)
- On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
