Pages that link to "Item:Q2391001"
From MaRDI portal
The following pages link to On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001):
Displaying 50 items.
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- SPN completable graphs (Q269250) (← links)
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization (Q283932) (← links)
- Conic relaxations for semi-supervised support vector machines (Q289094) (← links)
- Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes (Q309116) (← links)
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- Stochastic nonlinear resource allocation problem (Q325428) (← links)
- A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
- Copositive matrices with circulant zero support set (Q347484) (← links)
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets'' (Q360523) (← links)
- Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems (Q380592) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← 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)
- On the stable solution of large scale problems over the doubly nonnegative cone (Q403648) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- An improved algorithm to test copositivity (Q427387) (← links)
- Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
- On the computational complexity of membership problems for the completely positive cone and its dual (Q461444) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
- Quadratic optimization over a second-order cone with linear equality constraints (Q489094) (← links)
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691) (← links)
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization (Q496589) (← links)
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) (← links)
- Chance constrained \(0-1\) quadratic programs using copulas (Q499685) (← links)
- Copositivity and sparsity relations using spectral properties (Q504815) (← links)
- On reduced semidefinite programs for second order moment bounds with applications (Q507337) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- A semidefinite algorithm for completely positive tensor decomposition (Q513715) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- On cones of nonnegative quartic forms (Q525602) (← links)
- Geometry of the copositive and completely positive cones (Q534759) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- An algorithm for determining copositive matrices (Q636239) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Computing symmetric nonnegative rank factorizations (Q651217) (← links)
- Exceptional family and solvability of copositive complementarity problems (Q662097) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- Burer's key assumption for semidefinite and doubly nonnegative relaxations (Q691396) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
- A polynomial-time interior-point method for circular cone programming based on kernel functions (Q747043) (← links)
