Pages that link to "Item:Q2885468"
From MaRDI portal
The following pages link to On the accuracy of uniform polyhedral approximations of the copositive cone (Q2885468):
Displaying 32 items.
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Scaling relationship between the copositive cone and Parrilo's first level approximation (Q395830) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- A refined error analysis for fixed-degree polynomial optimization over the simplex (Q489141) (← links)
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization (Q496589) (← links)
- Improved approximation results on standard quartic polynomial optimization (Q1686564) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming (Q1812072) (← links)
- A simplex algorithm for rational cp-factorization (Q2020599) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Rational polyhedral outer-approximations of the second-order cone (Q2042079) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (Q2301196) (← links)
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131) (← links)
- Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
- Approximating the cone of copositive kernels to estimate the stability number of infinite graphs (Q2413190) (← links)
- Copositive programming via semi-infinite optimization (Q2435031) (← links)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
- New approximations for the cone of copositive matrices and its dual (Q2452380) (← links)
- Approximation of the stability number of a graph via copositive programming (Q2784442) (← links)
- Approximation of copositive programming via linear programming using second order sum of square decomposition (Q2898622) (← links)
- On LP-based approximation for copositive formulation of stable set problem (Q3121395) (← links)
- Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis (Q4594850) (← links)
- A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution (Q5502241) (← links)
- Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- Approximation hierarchies for copositive cone over symmetric cone and their comparison (Q6122328) (← links)
