Pages that link to "Item:Q439919"

The following pages link to Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919):

Displaying 23 items.

• On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
• On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
• Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
• A note on set-semidefinite relaxations of nonconvex quadratic programs (Q386483) (← links)
• A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties (Q494344) (← links)
• On cones of nonnegative quartic forms (Q525602) (← links)
• A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
• Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621) (← links)
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
• A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides (Q1753067) (← links)
• A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming (Q1789641) (← links)
• An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
• An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
• An exact completely positive programming formulation for the discrete ordered median problem: an extended version (Q2176282) (← links)
• Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
• Completely positive reformulations for polynomial optimization (Q2349130) (← links)
• Copositive programming via semi-infinite optimization (Q2435031) (← links)
• Interplay of non-convex quadratically constrained problems with adjustable robust optimization (Q2661757) (← links)
• Necessary and sufficient conditions for copositive tensors (Q2938323) (← links)
• Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming (Q5058050) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
• Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)