Pages that link to "Item:Q378112"

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

Displaying 47 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)
• Enhancing RLT relaxations via a new class of semidefinite cuts (Q598599) (← links)
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
• A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
• Convex relaxations for mixed integer predictive control (Q710707) (← links)
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
• Semidefinite programming relaxation for nonconvex quadratic programs (Q1361074) (← 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)
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
• Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← 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 finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
• On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
• SDP diagonalizations and perspective cuts for a class of nonseparable MIQP (Q2643791) (← links)
• On globally solving the extended trust-region subproblems (Q2661497) (← links)
• \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
• Nonconvex quadratic programming, semidefinite relaxations and randomization algorithms in information and decision systems (Q2722588) (← links)
• (Q2751323) (← 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)
• (Q3678971) (← links)
• Convex relaxations for mixed-integer nonlinear programs (Q4605948) (← links)
• A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
• Decision Diagram Decomposition for Quadratically Constrained Binary Optimization (Q4995079) (← links)
• Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
• Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
• Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)
• An efficient splitting algorithm for solving the CDT subproblem (Q6561567) (← links)
• Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)