数学随机对偶理论--大规模CLuP
Algorithmic random duality theory -- large scale CLuP
摘要:
基于我们的\bl{\textbf{Random Duality Theory (RDT)}},在我们最近的一系列论文\cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19}中,我们引入了一个强大的算法机制(称为\bl{\textbf{CLuP}}),可以用来解决\textbf{\emph{exactly}} NP难优化问题在多项式时间。在这里,我们进一步利用了另一个显著的RDT特性,这些特性是我们在\cite{StojnicCSetam09,StojnicCSetamBlock09,StojnicISIT2010binary,StojnicDiscPercp13,StojnicUpper10,StojnicGenLasso10,StojnicGenSocp10,StojnicPrDepSocp10,StojnicRegRndDlt10,Stojnicbinary16fin,Stojnicbinary16asym}的长期工作中建立的。也就是说,除了在表征各种随机结构和优化问题的性能方面惊人的精确之外,RDT同时还提供了一种几乎不并行的方法来创建计算效率高的优化算法,以实现这种性能。我们成功的关键之一是我们能够将最初的\textbf{\emph{constrained}}优化转换为\textbf{\emph{unconstrained}}优化,并且在这样做的过程中,在概念上和计算上都大大简化了事情。这最终使我们能够在非常大的规模上解决大量的经典优化问题。在这里,我们演示了如何将这种思想应用于CLuP,并最终用于解决\cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19}的基本CLuP可以解决的几乎任何问题。
英文摘要:
Based on our \bl{\textbf{Random Duality Theory (RDT)}}, in a sequence of our recent papers \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19}, we introduced a powerful algorithmic mechanism (called \bl{\textbf{CLuP}}) that can be utilized to solve \textbf{\emph{exactly}} NP hard optimization problems in polynomial time. Here we move things further and utilize another of remarkable RDT features that we established in a long line of work in \cite{StojnicCSetam09,StojnicCSetamBlock09,StojnicISIT2010binary,StojnicDiscPercp13,StojnicUpper10,StojnicGenLasso10,StojnicGenSocp10,StojnicPrDepSocp10,StojnicRegRndDlt10,Stojnicbinary16fin,Stojnicbinary16asym}. Namely, besides being stunningly precise in characterizing the performance of various random structures and optimization problems, RDT simultaneously also provided an almost unparallel way for creating computationally efficient optimization algorithms that achieve such performance. One of the keys to our success was our ability to transform the initial \textbf{\emph{constrained}} optimization into an \textbf{\emph{unconstrained}} one and in doing so greatly simplify things both conceptually and computationally. That ultimately enabled us to solve a large set of classical optimization problems on a very large scale level. Here, we demonstrate how such a thinking can be applied to CLuP as well and eventually utilized to solve pretty much any problem that the basic CLuP from \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19} can solve.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。