Pages that link to "Item:Q2229751"

The following pages link to Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751):

Displaying 13 items.

• An improved algorithm for deciding semi-definite polynomials (Q404554) (← links)
• The algebraic degree of semidefinite programming (Q847857) (← links)
• An effective decision method for semidefinite polynomials (Q1432891) (← links)
• Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (Q2105455) (← links)
• Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
• Solving rank-constrained semidefinite programs in exact arithmetic (Q2409017) (← links)
• Exact algorithms for linear matrix inequalities (Q2834563) (← links)
• Solving Rank-Constrained Semidefinite Programs in Exact Arithmetic (Q2985848) (← links)
• Exact Semidefinite Programming Bounds for Packing Problems (Q4989941) (← links)
• (Q5120196) (redirect page) (← links)
• On Exact Polya and Putinar's Representations (Q5120207) (← links)
• On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate (Q5864697) (← links)
• Estimation under group actions: recovering orbits from invariants (Q6172176) (← links)