Pages that link to "Item:Q5746688"

The following pages link to Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs (Q5746688):

Displaying 29 items.

• On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
• An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
• Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes (Q524905) (← links)
• Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
• Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
• A note on weakly active constraints in connection with nonconvex quadratic programming (Q1197678) (← links)
• A fair division approach to humanitarian logistics inspired by conditional value-at-risk (Q1640048) (← links)
• Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← links)
• A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602) (← links)
• A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
• On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
• On convex relaxations of quadrilinear terms (Q1959235) (← links)
• A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
• Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
• Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications (Q2422876) (← links)
• Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← 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)
• New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
• Improved convex and concave relaxations of composite bilinear forms (Q2697000) (← links)
• Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (Q2826815) (← links)
• Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching (Q3386791) (← links)
• Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs (Q3396382) (← links)
• An unconstrained convex programming approach to solving convex quadratic programming problems (Q3835665) (← links)
• (Q4542378) (← links)
• Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality (Q5002413) (← links)