Pages that link to "Item:Q5408222"
From MaRDI portal
The following pages link to A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming (Q5408222):
Displaying 31 items.
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization (Q283932) (← links)
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming (Q380506) (← links)
- Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization (Q496589) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- A note on composite concave quadratic programming (Q1306393) (← 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)
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints (Q1751215) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- A note on completely positive relaxations of quadratic problems in a multiobjective framework (Q2114601) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- Minimal conic quadratic reformulations and an optimization model (Q2294364) (← links)
- A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- Quadratic optimization over a polyhedral cone (Q2515280) (← links)
- Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
- The CP-matrix approximation problem (Q2790067) (← links)
- On the set-semidefinite representation of nonconvex quadratic programs with cone constraints (Q2903231) (← links)
- Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis (Q4594850) (← links)
- (Q4887683) (← links)
- A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems (Q5110556) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
