\beamer@endinputifotherversion {3.01pt}
\select@language {english}
\beamer@sectionintoc {1}{ Motivation, Notation, Preliminaries}{4}{0}{1}
\beamer@subsectionintoc {1}{1}{SDP Duality Gap Example}{9}{0}{1}
\beamer@subsectionintoc {1}{2}{SUBSPACE FORM and MINIMAL REPRESENTATIONS}{13}{0}{1}
\beamer@subsectionintoc {1}{3}{Recession Directions and Minimal Subspaces}{18}{0}{1}
\beamer@sectionintoc {2}{REGULARIZATION for Cone Programs}{24}{0}{2}
\beamer@subsectionintoc {2}{1}{Minimal Representations using MINIMAL FACE}{24}{0}{2}
\beamer@subsectionintoc {2}{2}{Minimal Representations using MINIMAL SUBSPACE}{26}{0}{2}
\beamer@subsectionintoc {2}{3}{Constraint Qualifications, CQs, for (P)}{31}{0}{2}
\beamer@sectionintoc {3}{Towards a Better regularization}{33}{0}{3}
\beamer@subsectionintoc {3}{1}{A {Stable} Auxiliary Problem}{36}{0}{3}
\beamer@sectionintoc {4}{Numerical Tests}{39}{0}{4}
\beamer@sectionintoc {5}{Strict Complementarity and Nonzero Duality Gaps}{41}{0}{5}
\beamer@subsectionintoc {5}{1}{Generating Hard SDP Instances}{49}{0}{5}
\beamer@subsectionintoc {5}{2}{Complementarity Partition and Nonzero Duality Gap}{54}{0}{5}
\beamer@sectionintoc {6}{Concluding Remarks}{59}{0}{6}