~/talk

LP/SDP Hierarchies and Sum of Squares Proofs 2

links:none on file
links:none on file
slides:none on file

Real infeasibility certificates appear as an f + g = -1 certificate with f in the ideal of equations and g in the cone generated by inequalities; bounding the syntactic degree turns the search into a degree-bounded SDP that is solvable in practice. Pathologies include rational p that require irrational q or huge bit-complexity dependence, so one works with epsilon-approximations. Over the hypercube a delta-function SOS gives a trivial certificate; practical reductions use symmetry reduction and sparsity or quotient rings to keep the SDP tractable.

AI-written summary · about

  1. 0:00Intro
  2. 11:05Inequality
  3. 14:50Possible constraints
  4. 18:20The real notional sense
  5. 21:40Infeasible equations
  6. 27:25polynomial equations
  7. 32:50non polynomial equations
  8. 38:00algebraically compact
  9. 41:28why is this even true
  10. 45:05why do I do this
  11. 50:00what matters
  12. 51:25semidefinite problems
  13. 52:50Explicit equations
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.