Pages that link to "Item:Q378112"

The following pages link to Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112):

Displaying 26 items.

• Transformation-based preprocessing for mixed-integer quadratic programs (Q283953) (← links)
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
• A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
• A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
• A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (Q1785386) (← links)
• SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (Q2097634) (← links)
• Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
• Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
• Optimal portfolio deleveraging under market impact and margin restrictions (Q2240011) (← links)
• A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
• A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
• QPLIB: a library of quadratic programming instances (Q2281448) (← links)
• On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
• Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← links)
• Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
• SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
• On globally solving the extended trust-region subproblems (Q2661497) (← links)
• \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
• Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations (Q2826815) (← links)
• A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs (Q2835666) (← links)
• Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394) (← links)
• Decision Diagram Decomposition for Quadratically Constrained Binary Optimization (Q4995079) (← links)