Pages that link to "Item:Q1812072"
From MaRDI portal
The following pages link to Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming (Q1812072):
Displaying 50 items.
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization (Q283932) (← links)
- Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
- A note on set-semidefinite relaxations of nonconvex quadratic programs (Q386483) (← links)
- Scaling relationship between the copositive cone and Parrilo's first level approximation (Q395830) (← 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)
- A refined error analysis for fixed-degree polynomial optimization over the simplex (Q489141) (← 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)
- On the convergence rate of grid search for polynomial optimization over the simplex (Q519777) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization (Q656831) (← links)
- Exceptional family and solvability of copositive complementarity problems (Q662097) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Constructing patterns of (many) ESSs under support size control (Q831065) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints (Q925234) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach (Q932200) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- A clique algorithm for standard quadratic programming (Q955308) (← links)
- Well supported approximate equilibria in bimatrix games (Q973002) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- Searching for critical angles in a convex cone (Q1016350) (← links)
- Complexity results for some global optimization problems (Q1024247) (← links)
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← links)
- Improved approximation results on standard quartic polynomial optimization (Q1686564) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- Separable standard quadratic optimization problems (Q1758025) (← links)
- A MAX-CUT formulation of 0/1 programs (Q1785732) (← links)
- Dense neighborhoods on affinity graph (Q1931579) (← links)
- Approximation algorithm for a class of global optimization problems (Q1937958) (← links)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
- Characterizing existence of minimizers and optimality to nonconvex quadratic integrals (Q2031964) (← links)
