Pages that link to "Item:Q4208353"

The following pages link to The completely positive and doubly nonnegative completion problems (Q4208353):

Displaying 12 items.

• SPN completable graphs (Q269250) (← links)
• The symmetric \(M\)-matrix and symmetric inverse \(M\)-matrix completion problems (Q697049) (← links)
• Sub-direct sums and positivity classes of matrices (Q1300873) (← links)
• \(P\)-matrix completions under weak symmetry assumptions (Q1573659) (← links)
• The cycle completable graphs for the completely positive and doubly nonnegative completion problems (Q1579520) (← links)
• Note on subdirect sums of \(\{i_0\}\)-Nekrasov matrices (Q2129763) (← links)
• Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
• Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
• The integer cp-rank of \(2 \times 2\) matrices (Q2302880) (← links)
• Adjacent edge conditions for the totally nonnegative completion problem (Q3502314) (← links)
• Note on subdirect sums of SDD(<i>p</i>) matrices (Q5038141) (← links)
• Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization (Q6166103) (← links)