Page MenuHomec4science

main.aux
No OneTemporary

File Metadata

Created
Wed, May 29, 00:39

main.aux

\relax
\providecommand\hyper@newdestlabel[2]{}
\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
\global\let\oldcontentsline\contentsline
\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\global\let\oldnewlabel\newlabel
\gdef\newlabel#1#2{\newlabelxx{#1}#2}
\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\AtEndDocument{\ifx\hyper@anchor\@undefined
\let\contentsline\oldcontentsline
\let\newlabel\oldnewlabel
\fi}
\fi}
\global\let\hyper@last\relax
\gdef\HyperFirstAtBeginDocument#1{#1}
\providecommand\HyField@AuxAddToFields[1]{}
\providecommand\HyField@AuxAddToCoFields[2]{}
\citation{parikh2014proximal}
\citation{khot2011grothendieck,lovasz2003semidefinite,zhao1998semidefinite}
\citation{mossel2015consistency,song2007dependence}
\citation{singer2011angular,singer2011three}
\citation{zhao1998semidefinite}
\citation{raghavendra2008optimal}
\citation{yurtsever2018conditional}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}{section.1}}
\newlabel{intro}{{1}{1}{Introduction}{section.1}{}}
\newlabel{prob:01}{{1}{1}{Introduction}{equation.1.1}{}}
\@writefile{toc}{\contentsline {paragraph}{Vignette: Burer-Monteiro splitting.}{1}{section*.1}}
\newlabel{eq:sdp}{{2}{1}{Vignette: Burer-Monteiro splitting}{equation.1.2}{}}
\citation{burer2003nonlinear,burer2005local}
\citation{pataki1998rank,barvinok1995problems}
\citation{waldspurger2018rank}
\citation{burer2005local}
\citation{boumal2016non}
\citation{burer2003nonlinear,burer2005local,kulis2007fast}
\citation{parikh2014proximal}
\citation{nocedal2006numerical}
\citation{nedelcu2014computational,lan2016iteration,xu2017inexact}
\citation{karimi2016linear}
\citation{bertsekas1982constrained}
\citation{hestenes1969multiplier,powell1969method}
\citation{bertsekas1982constrained,birgin2014practical}
\newlabel{prob:nc}{{3}{2}{Vignette: Burer-Monteiro splitting}{equation.1.3}{}}
\newlabel{sec:preliminaries}{{2}{2}{Preliminaries}{section.2}{}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Preliminaries }{2}{section.2}}
\@writefile{toc}{\contentsline {paragraph}{\textbf {{Notation.}}}{2}{section*.2}}
\newlabel{eq:smoothness basic}{{4}{2}{\textbf {{Notation.}}}{equation.2.4}{}}
\newlabel{eq:minmax}{{5}{2}{\textbf {{Notation.}}}{equation.2.5}{}}
\newlabel{eq:Lagrangian}{{6}{2}{\textbf {{Notation.}}}{equation.2.6}{}}
\citation{bertsekas1976penalty}
\newlabel{e:exac}{{7}{3}{\textbf {{Notation.}}}{equation.2.7}{}}
\@writefile{toc}{\contentsline {paragraph}{{\textbf {Optimality conditions.}}}{3}{section*.3}}
\newlabel{e:inclu2}{{8}{3}{\textbf {Optimality conditions.}}{equation.2.8}{}}
\newlabel{eq:inclu3app}{{9}{3}{\textbf {Optimality conditions.}}{equation.2.9}{}}
\newlabel{eq:cvg metricapp}{{10}{3}{\textbf {Optimality conditions.}}{equation.2.10}{}}
\newlabel{eq:dist_subgrad}{{11}{3}{\textbf {Optimality conditions.}}{equation.2.11}{}}
\newlabel{eq:sec_opt}{{13}{3}{\textbf {Optimality conditions.}}{equation.2.13}{}}
\@writefile{toc}{\contentsline {paragraph}{{\textbf {Smoothness lemma.}}}{3}{section*.4}}
\newlabel{lem:smoothness}{{2.1}{3}{\textbf {smoothness}}{theorem.2.1}{}}
\newlabel{eq:smoothness of Lagrangian}{{15}{3}{\textbf {smoothness}}{equation.2.15}{}}
\newlabel{sec:AL algorithm}{{3}{3}{Algorithm}{section.3}{}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Algorithm }{3}{section.3}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {1}{\ignorespaces Inexact ALM for solving\nobreakspace {}\textup {\hbox {\mathsurround \z@ \normalfont (\ignorespaces \ref {prob:01}\unskip \@@italiccorr )}}}}{4}{algorithm.1}}
\newlabel{Algo:2}{{1}{4}{Algorithm}{algorithm.1}{}}
\newlabel{sec:cvg rate}{{4}{4}{Convergence Rate}{section.4}{}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Convergence Rate }{4}{section.4}}
\newlabel{thm:main}{{4.1}{4}{}{theorem.4.1}{}}
\newlabel{eq:defn_restricted_lipsichtz}{{17}{4}{}{equation.4.17}{}}
\newlabel{eq:regularity}{{18}{4}{}{equation.4.18}{}}
\newlabel{eq:stat_prec_first}{{19}{4}{}{equation.4.19}{}}
\citation{karimi2016linear}
\citation{xu2017globally}
\citation{bolte2018nonconvex}
\citation{rockafellar1993lagrange}
\citation{bolte2018nonconvex}
\citation{flores2012complete}
\citation{ghadimi2016accelerated}
\citation{cartis2012complexity}
\citation{ghadimi2016accelerated}
\citation{cartis2012complexity}
\citation{cartis2018optimality}
\citation{birgin2016evaluation}
\@writefile{toc}{\contentsline {paragraph}{Penalty method.}{5}{section*.5}}
\newlabel{cor:first}{{4.2}{5}{First-order optimality}{theorem.4.2}{}}
\newlabel{cor:second}{{4.3}{5}{Second-order optimality}{theorem.4.3}{}}
\citation{hestenes1969multiplier,powell1969method}
\citation{lan2016iteration,nedelcu2014computational,tran2018adaptive,xu2017inexact}
\citation{bertsekas2014constrained}
\citation{fernandez2012local}
\citation{birgin2016evaluation}
\citation{cartis2018optimality}
\citation{cartis2011evaluation}
\citation{bolte2018nonconvex}
\citation{bolte2017error}
\citation{clason2018acceleration}
\citation{chambolle2011first}
\citation{burer2003nonlinear,burer2005local}
\citation{bhojanapalli2016dropping,park2016provable}
\citation{boumal2014manopt,boumal2016global,boumal2016non}
\citation{boumal2016global}
\citation{nesterov2009primal,yurtsever2015universal,yurtsever2018conditional}
\citation{jaggi2013revisiting}
\@writefile{toc}{\contentsline {paragraph}{Remark.}{6}{section*.6}}
\newlabel{sec:related work}{{5}{6}{Related Work}{section.5}{}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Related Work }{6}{section.5}}
\citation{dai2002convergence,mascarenhas2004bfgs}
\citation{cartis2012complexity}
\citation{Peng2007}
\citation{kulis2007fast}
\citation{fletcher2013practical}
\citation{yurtsever2018conditional}
\citation{yang2015sdpnal}
\citation{mixon2016clustering}
\citation{xiao2017/online}
\citation{kulis2007fast}
\citation{tepper2018clustering}
\newlabel{sec:experiments}{{6}{7}{Numerical Evidence}{section.6}{}}
\@writefile{toc}{\contentsline {section}{\numberline {6}Numerical Evidence }{7}{section.6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.1}Clustering}{7}{subsection.6.1}}
\newlabel{eq:sdp_svx}{{24}{7}{Clustering}{equation.6.24}{}}
\newlabel{eq:nc_cluster}{{25}{7}{Clustering}{equation.6.25}{}}
\bibstyle{abbrv}
\bibdata{bibliography.bib}
\bibcite{barvinok1995problems}{{1}{}{{}}{{}}}
\bibcite{bertsekas1976penalty}{{2}{}{{}}{{}}}
\bibcite{bertsekas1982constrained}{{3}{}{{}}{{}}}
\bibcite{bertsekas2014constrained}{{4}{}{{}}{{}}}
\bibcite{bhojanapalli2018smoothed}{{5}{}{{}}{{}}}
\bibcite{bhojanapalli2016dropping}{{6}{}{{}}{{}}}
\bibcite{birgin2016evaluation}{{7}{}{{}}{{}}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Clustering running time comparison. }}{8}{figure.1}}
\newlabel{fig:clustering}{{1}{8}{Clustering running time comparison}{figure.1}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.2}Additional demonstrations}{8}{subsection.6.2}}
\@writefile{toc}{\contentsline {section}{\numberline {7}Conclusions}{8}{section.7}}
\bibcite{birgin2014practical}{{8}{}{{}}{{}}}
\bibcite{bolte2017error}{{9}{}{{}}{{}}}
\bibcite{bolte2018nonconvex}{{10}{}{{}}{{}}}
\bibcite{boumal2016global}{{11}{}{{}}{{}}}
\bibcite{boumal2014manopt}{{12}{}{{}}{{}}}
\bibcite{boumal2016non}{{13}{}{{}}{{}}}
\bibcite{burer2003nonlinear}{{14}{}{{}}{{}}}
\bibcite{burer2005local}{{15}{}{{}}{{}}}
\bibcite{cartis2011evaluation}{{16}{}{{}}{{}}}
\bibcite{cartis2012complexity}{{17}{}{{}}{{}}}
\bibcite{cartis2018optimality}{{18}{}{{}}{{}}}
\bibcite{chambolle2011first}{{19}{}{{}}{{}}}
\bibcite{clason2018acceleration}{{20}{}{{}}{{}}}
\bibcite{dai2002convergence}{{21}{}{{}}{{}}}
\bibcite{fernandez2012local}{{22}{}{{}}{{}}}
\bibcite{ferreira2018semidefinite}{{23}{}{{}}{{}}}
\bibcite{fletcher2013practical}{{24}{}{{}}{{}}}
\bibcite{flores2012complete}{{25}{}{{}}{{}}}
\bibcite{ge2016efficient}{{26}{}{{}}{{}}}
\bibcite{ghadimi2016accelerated}{{27}{}{{}}{{}}}
\bibcite{Goodfellow2014}{{28}{}{{}}{{}}}
\bibcite{hestenes1969multiplier}{{29}{}{{}}{{}}}
\bibcite{Ilyas2017}{{30}{}{{}}{{}}}
\bibcite{jaggi2013revisiting}{{31}{}{{}}{{}}}
\bibcite{karimi2016linear}{{32}{}{{}}{{}}}
\bibcite{khot2011grothendieck}{{33}{}{{}}{{}}}
\bibcite{Kingma2014}{{34}{}{{}}{{}}}
\bibcite{kulis2007fast}{{35}{}{{}}{{}}}
\bibcite{lan2016iteration}{{36}{}{{}}{{}}}
\bibcite{lovasz2003semidefinite}{{37}{}{{}}{{}}}
\bibcite{mascarenhas2004bfgs}{{38}{}{{}}{{}}}
\bibcite{mixon2016clustering}{{39}{}{{}}{{}}}
\bibcite{mossel2015consistency}{{40}{}{{}}{{}}}
\bibcite{nedelcu2014computational}{{41}{}{{}}{{}}}
\bibcite{nesterov2009primal}{{42}{}{{}}{{}}}
\bibcite{nesterov1983method}{{43}{}{{}}{{}}}
\bibcite{nocedal2006numerical}{{44}{}{{}}{{}}}
\bibcite{nouiehed2018convergence}{{45}{}{{}}{{}}}
\bibcite{obozinski2011group}{{46}{}{{}}{{}}}
\bibcite{parikh2014proximal}{{47}{}{{}}{{}}}
\bibcite{park2016provable}{{48}{}{{}}{{}}}
\bibcite{pataki1998rank}{{49}{}{{}}{{}}}
\bibcite{Peng2007}{{50}{}{{}}{{}}}
\bibcite{powell1969method}{{51}{}{{}}{{}}}
\bibcite{Radford2015}{{52}{}{{}}{{}}}
\bibcite{raghavendra2008optimal}{{53}{}{{}}{{}}}
\bibcite{rockafellar1993lagrange}{{54}{}{{}}{{}}}
\bibcite{Samangouei2018}{{55}{}{{}}{{}}}
\bibcite{singer2011angular}{{56}{}{{}}{{}}}
\bibcite{singer2011three}{{57}{}{{}}{{}}}
\bibcite{song2007dependence}{{58}{}{{}}{{}}}
\bibcite{tepper2018clustering}{{59}{}{{}}{{}}}
\bibcite{tran2018adaptive}{{60}{}{{}}{{}}}
\bibcite{tran2018smooth}{{61}{}{{}}{{}}}
\bibcite{waldspurger2018rank}{{62}{}{{}}{{}}}
\bibcite{xiao2017/online}{{63}{}{{}}{{}}}
\bibcite{xu2017inexact}{{64}{}{{}}{{}}}
\bibcite{xu2017globally}{{65}{}{{}}{{}}}
\bibcite{yang2015sdpnal}{{66}{}{{}}{{}}}
\bibcite{yurtsever2015universal}{{67}{}{{}}{{}}}
\bibcite{yurtsever2018conditional}{{68}{}{{}}{{}}}
\bibcite{zhao1998semidefinite}{{69}{}{{}}{{}}}
\citation{ghadimi2016accelerated}
\citation{nesterov1983method}
\citation{ghadimi2016accelerated}
\citation{ghadimi2016accelerated}
\citation{ghadimi2016accelerated}
\citation{cartis2012complexity}
\citation{nouiehed2018convergence}
\@writefile{toc}{\contentsline {section}{\numberline {A}Complexity Results}{13}{appendix.A}}
\newlabel{sec:first-o-opt}{{A.1}{13}{First-Order Optimality}{subsection.A.1}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {A.1}First-Order Optimality }{13}{subsection.A.1}}
\newlabel{eq:iter_1storder}{{27}{13}{First-Order Optimality}{equation.A.27}{}}
\newlabel{cor:first_supp}{{A.1}{13}{}{theorem.A.1}{}}
\newlabel{eq:acc_to_b}{{29}{13}{First-Order Optimality}{equation.A.29}{}}
\newlabel{eq: tk_bound}{{30}{13}{First-Order Optimality}{equation.A.30}{}}
\newlabel{sec:second-o-opt}{{A.2}{13}{Second-Order Optimality}{subsection.A.2}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {A.2}Second-Order Optimality }{13}{subsection.A.2}}
\citation{cartis2012complexity}
\citation{cartis2012complexity}
\citation{cartis2012complexity}
\citation{cartis2012complexity}
\citation{bhojanapalli2018smoothed}
\citation{tran2018smooth}
\newlabel{eq:sec_inn_comp}{{32}{14}{Second-Order Optimality}{equation.A.32}{}}
\newlabel{cor:second_supp}{{A.2}{14}{}{theorem.A.2}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {A.3}Approximate optimality of \textup {\hbox {\mathsurround \z@ \normalfont (\ignorespaces \ref {prob:01}\unskip \@@italiccorr )}}.}{14}{subsection.A.3}}
\newlabel{sec:theory}{{B}{14}{Proof of Theorem \ref {thm:main}}{appendix.B}{}}
\@writefile{toc}{\contentsline {section}{\numberline {B}Proof of Theorem \ref {thm:main} }{14}{appendix.B}}
\newlabel{eq:before_restriction}{{37}{15}{Proof of Theorem \ref {thm:main}}{equation.B.37}{}}
\newlabel{eq:restrited_pre}{{38}{15}{Proof of Theorem \ref {thm:main}}{equation.B.38}{}}
\newlabel{eq:before_dual_controlled}{{39}{15}{Proof of Theorem \ref {thm:main}}{equation.B.39}{}}
\newlabel{eq:dual growth}{{40}{15}{Proof of Theorem \ref {thm:main}}{equation.B.40}{}}
\newlabel{eq:cvg metric part 2}{{42}{15}{Proof of Theorem \ref {thm:main}}{equation.B.42}{}}
\newlabel{eq:cvg metric part 1 brk down}{{43}{15}{Proof of Theorem \ref {thm:main}}{equation.B.43}{}}
\newlabel{eq:part_1_2}{{44}{15}{Proof of Theorem \ref {thm:main}}{equation.B.44}{}}
\newlabel{eq:cvg metric part 1}{{45}{16}{Proof of Theorem \ref {thm:main}}{equation.B.45}{}}
\newlabel{eq:sec}{{48}{16}{Proof of Theorem \ref {thm:main}}{equation.B.48}{}}
\newlabel{sec:proof of smoothness lemma}{{C}{16}{Proof of Lemma \ref {lem:smoothness}}{appendix.C}{}}
\@writefile{toc}{\contentsline {section}{\numberline {C}Proof of Lemma \ref {lem:smoothness}}{16}{appendix.C}}
\newlabel{sec:verification2}{{D}{17}{Clustering}{appendix.D}{}}
\@writefile{toc}{\contentsline {section}{\numberline {D}Clustering }{17}{appendix.D}}
\newlabel{eq:Jacobian clustering}{{55}{17}{Clustering}{equation.D.55}{}}
\newlabel{eq:exp-subgrad-cluster}{{57}{17}{Clustering}{equation.D.57}{}}
\citation{tran2018adaptive,chambolle2011first}
\citation{chambolle2011first}
\citation{tran2018smooth}
\citation{tran2018adaptive}
\citation{obozinski2011group}
\newlabel{eq:final-cnd-cluster}{{58}{18}{Clustering}{equation.D.58}{}}
\@writefile{toc}{\contentsline {section}{\numberline {E}Additional Experiments}{18}{appendix.E}}
\newlabel{sec:adexp}{{E}{18}{Additional Experiments}{appendix.E}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.1}Basis Pursuit}{18}{subsection.E.1}}
\newlabel{sec:bp}{{E.1}{18}{Basis Pursuit}{subsection.E.1}{}}
\newlabel{eq:bp_main}{{59}{18}{Basis Pursuit}{equation.E.59}{}}
\newlabel{eq:bp-equiv}{{60}{18}{Basis Pursuit}{equation.E.60}{}}
\@writefile{toc}{\contentsline {paragraph}{Discussion:}{18}{section*.8}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Basis Pursuit}}{19}{figure.2}}
\newlabel{fig:bp1}{{2}{19}{Basis Pursuit}{figure.2}{}}
\@writefile{toc}{\contentsline {paragraph}{Condition verification:}{19}{section*.9}}
\newlabel{eq:jacob-bp}{{61}{19}{Condition verification:}{equation.E.61}{}}
\newlabel{eq:cnd-bp-pre}{{62}{19}{Condition verification:}{equation.E.62}{}}
\citation{ge2016efficient}
\citation{boumal2016non}
\newlabel{eq:final-bp-cnd}{{64}{20}{Condition verification:}{equation.E.64}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.2}Generalized Eigenvalue Problem}{20}{subsection.E.2}}
\newlabel{sec:geig}{{E.2}{20}{Generalized Eigenvalue Problem}{subsection.E.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces {\it {(Top)}} Objective convergence for calculating top generalized eigenvalue and eigenvector of $B$ and $C$. {\it {(Bottom)}} Eigenvalue structure of the matrices. For (i),(ii) and (iii), $C$ is positive semidefinite; for (iv), (v) and (vi), $C$ contains negative eigenvalues. {[(i): Generated by taking symmetric part of iid Gaussian matrix. (ii): Generated by randomly rotating diag($1^{-p}, 2^{-p}, \cdots , 1000^{-p}$)($p=1$). (iii): Generated by randomly rotating diag($10^{-p}, 10^{-2p}, \cdots , 10^{-1000p}$)($p=0.0025$).]} }}{20}{figure.3}}
\newlabel{fig:geig1}{{3}{20}{{\it {(Top)}} Objective convergence for calculating top generalized eigenvalue and eigenvector of $B$ and $C$. {\it {(Bottom)}} Eigenvalue structure of the matrices. For (i),(ii) and (iii), $C$ is positive semidefinite; for (iv), (v) and (vi), $C$ contains negative eigenvalues. {[(i): Generated by taking symmetric part of iid Gaussian matrix. (ii): Generated by randomly rotating diag($1^{-p}, 2^{-p}, \cdots , 1000^{-p}$)($p=1$). (iii): Generated by randomly rotating diag($10^{-p}, 10^{-2p}, \cdots , 10^{-1000p}$)($p=0.0025$).]}}{figure.3}{}}
\newlabel{eq:eig}{{65}{20}{Generalized Eigenvalue Problem}{equation.E.65}{}}
\citation{boumal2016global}
\citation{ge2016efficient}
\citation{manopt}
\citation{Samangouei2018,Ilyas2017}
\citation{Goodfellow2014}
\citation{Radford2015}
\citation{Kingma2014}
\newlabel{eq:eig-sdp}{{66}{21}{Generalized Eigenvalue Problem}{equation.E.66}{}}
\newlabel{eq:eig-equiv}{{67}{21}{Generalized Eigenvalue Problem}{equation.E.67}{}}
\@writefile{toc}{\contentsline {paragraph}{Condition verification:}{21}{section*.10}}
\newlabel{eq:jacobian-gen-eval}{{68}{21}{Condition verification:}{equation.E.68}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.3}$\ell _\infty $ Denoising with a Generative Prior}{21}{subsection.E.3}}
\newlabel{sec:gan}{{E.3}{21}{$\ell _\infty $ Denoising with a Generative Prior}{subsection.E.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces Augmented Lagrangian vs Adam and Gradient descent for $\ell _\infty $ denoising}}{22}{figure.4}}
\newlabel{fig:comparison_fab}{{4}{22}{Augmented Lagrangian vs Adam and Gradient descent for $\ell _\infty $ denoising}{figure.4}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.4}Quadratic assginment problem}{22}{subsection.E.4}}
\newlabel{sec:qap}{{E.4}{22}{Quadratic assginment problem}{subsection.E.4}{}}
\newlabel{eq:qap1}{{71}{22}{Quadratic assginment problem}{equation.E.71}{}}
\newlabel{eq:qapkron}{{72}{22}{Quadratic assginment problem}{equation.E.72}{}}
\newlabel{eq:qapcons}{{73}{22}{Quadratic assginment problem}{equation.E.73}{}}
\newlabel{eq:qap_sdp}{{74}{22}{Quadratic assginment problem}{equation.E.74}{}}
\citation{ferreira2018semidefinite}
\citation{ferreira2018semidefinite}
\citation{pataki1998rank,barvinok1995problems}
\citation{ferreira2018semidefinite}
\citation{ferreira2018semidefinite}
\providecommand\NAT@force@numbers{}\NAT@force@numbers
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Comparison between upper bounds on the problems from the QAP library with (relatively) sparse $L$.}}{24}{table.1}}
\newlabel{tb:qap}{{1}{24}{Comparison between upper bounds on the problems from the QAP library with (relatively) sparse $L$}{table.1}{}}

Event Timeline