Pages that link to "Item:Q868475"

The following pages link to Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation (Q868475):

Displaying 43 items.

• A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
• Remarks on a conjecture of Barát and Tóth (Q405159) (← 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)
• The optimal drawings of \(K_{5,n}\) (Q463036) (← links)
• Drawing complete multipartite graphs on the plane with restrictions on crossings (Q477904) (← links)
• Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
• A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
• On crossing numbers of geometric proximity graphs (Q632725) (← links)
• Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
• Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
• Upper bounds on algebraic connectivity via convex optimization (Q855560) (← links)
• Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
• Strengthened semidefinite programming bounds for codes (Q868466) (← links)
• A branch-and-cut approach to the crossing number problem (Q951113) (← links)
• Symmetry in semidefinite programs (Q958029) (← links)
• The crossing number of \(K_{1,m,n}\) (Q998333) (← links)
• On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs (Q1024280) (← links)
• Exploiting group symmetry in truss topology optimization (Q1041375) (← links)
• Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
• Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
• Group symmetry and covariance regularization (Q1950873) (← links)
• On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
• Perturbation analysis for matrix joint block diagonalization (Q2273874) (← links)
• New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
• Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
• The rectilinear local crossing number of \(K_{n}\) (Q2363361) (← links)
• The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
• Simultaneous singular value decomposition (Q2431173) (← links)
• Book drawings of complete bipartite graphs (Q2440102) (← links)
• A note on the stability number of an orthogonality graph (Q2643845) (← links)
• A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
• Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517) (← links)
• Invariant Semidefinite Programs (Q2802527) (← links)
• On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (Q2821802) (← links)
• (Q2857359) (← links)
• An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization (Q2957679) (← links)
• The Crossing Number of the Cone of a Graph (Q2961536) (← links)
• An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
• Reduction of truss topology optimization (Q3052591) (← links)