Matches in SemOpenAlex for { <https://semopenalex.org/work/W4300025101> ?p ?o ?g. }
Showing items 1 to 66 of
66
with 100 items per page.
- W4300025101 abstract "Convex relaxations based on different hierarchies of linear/semi-definite programs have been used recently to devise approximation algorithms for various optimization problems. The approximation guarantee of these algorithms improves with the number of {em rounds} $r$ in the hierarchy, though the complexity of solving (or even writing down the solution for) the $r$'th level program grows as $n^{Omega(r)}$ where $n$ is the input size. In this work, we observe that many of these algorithms are based on {em local} rounding procedures that only use a small part of the SDP solution (of size $n^{O(1)} 2^{O(r)}$ instead of $n^{Omega(r)}$). We give an algorithm to find the requisite portion in time polynomial in its size. The challenge in achieving this is that the required portion of the solution is not fixed a priori but depends on other parts of the solution, sometimes in a complicated iterative manner. Our solver leads to $n^{O(1)} 2^{O(r)}$ time algorithms to obtain the same guarantees in many cases as the earlier $n^{O(r)}$ time algorithms based on $r$ rounds of the Lasserre hierarchy. In particular, guarantees based on $O(log n)$ rounds can be realized in polynomial time. We develop and describe our algorithm in a fairly general abstract framework. The main technical tool in our work, which might be of independent interest in convex optimization, is an efficient ellipsoid algorithm based separation oracle for convex programs that can output a {em certificate of infeasibility with restricted support}. This is used in a recursive manner to find a sequence of consistent points in nested convex bodies that fools local rounding algorithms." @default.
- W4300025101 created "2022-10-03" @default.
- W4300025101 creator A5068388812 @default.
- W4300025101 creator A5086919065 @default.
- W4300025101 date "2012-07-18" @default.
- W4300025101 modified "2023-09-27" @default.
- W4300025101 title "Faster SDP hierarchy solvers for local rounding algorithms" @default.
- W4300025101 doi "https://doi.org/10.48550/arxiv.1207.4372" @default.
- W4300025101 hasPublicationYear "2012" @default.
- W4300025101 type Work @default.
- W4300025101 citedByCount "0" @default.
- W4300025101 crossrefType "posted-content" @default.
- W4300025101 hasAuthorship W4300025101A5068388812 @default.
- W4300025101 hasAuthorship W4300025101A5086919065 @default.
- W4300025101 hasBestOaLocation W43000251011 @default.
- W4300025101 hasConcept C111919701 @default.
- W4300025101 hasConcept C112680207 @default.
- W4300025101 hasConcept C11413529 @default.
- W4300025101 hasConcept C114614502 @default.
- W4300025101 hasConcept C115903868 @default.
- W4300025101 hasConcept C118615104 @default.
- W4300025101 hasConcept C126255220 @default.
- W4300025101 hasConcept C136625980 @default.
- W4300025101 hasConcept C162324750 @default.
- W4300025101 hasConcept C2524010 @default.
- W4300025101 hasConcept C2778770139 @default.
- W4300025101 hasConcept C311688 @default.
- W4300025101 hasConcept C31170391 @default.
- W4300025101 hasConcept C33923547 @default.
- W4300025101 hasConcept C34447519 @default.
- W4300025101 hasConcept C41008148 @default.
- W4300025101 hasConcept C55166926 @default.
- W4300025101 hasConceptScore W4300025101C111919701 @default.
- W4300025101 hasConceptScore W4300025101C112680207 @default.
- W4300025101 hasConceptScore W4300025101C11413529 @default.
- W4300025101 hasConceptScore W4300025101C114614502 @default.
- W4300025101 hasConceptScore W4300025101C115903868 @default.
- W4300025101 hasConceptScore W4300025101C118615104 @default.
- W4300025101 hasConceptScore W4300025101C126255220 @default.
- W4300025101 hasConceptScore W4300025101C136625980 @default.
- W4300025101 hasConceptScore W4300025101C162324750 @default.
- W4300025101 hasConceptScore W4300025101C2524010 @default.
- W4300025101 hasConceptScore W4300025101C2778770139 @default.
- W4300025101 hasConceptScore W4300025101C311688 @default.
- W4300025101 hasConceptScore W4300025101C31170391 @default.
- W4300025101 hasConceptScore W4300025101C33923547 @default.
- W4300025101 hasConceptScore W4300025101C34447519 @default.
- W4300025101 hasConceptScore W4300025101C41008148 @default.
- W4300025101 hasConceptScore W4300025101C55166926 @default.
- W4300025101 hasLocation W43000251011 @default.
- W4300025101 hasLocation W43000251012 @default.
- W4300025101 hasOpenAccess W4300025101 @default.
- W4300025101 hasPrimaryLocation W43000251011 @default.
- W4300025101 hasRelatedWork W118903834 @default.
- W4300025101 hasRelatedWork W1991299446 @default.
- W4300025101 hasRelatedWork W2024309621 @default.
- W4300025101 hasRelatedWork W2040387487 @default.
- W4300025101 hasRelatedWork W2045924252 @default.
- W4300025101 hasRelatedWork W2069652878 @default.
- W4300025101 hasRelatedWork W2162716966 @default.
- W4300025101 hasRelatedWork W2399272054 @default.
- W4300025101 hasRelatedWork W2577192446 @default.
- W4300025101 hasRelatedWork W3003856821 @default.
- W4300025101 isParatext "false" @default.
- W4300025101 isRetracted "false" @default.
- W4300025101 workType "article" @default.