Questions tagged [smoothed-analysis]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
6 votes
1 answer

Is there a simplex-like algorithm that can be used with a separation oracle?

Linear programs can be solved in polynomial time using the ellipsoid method, but in practice the Simplex method is much more efficient, and the smoothed analysis framework of Spielman and Teng ...
Erel Segal-Halevi's user avatar
7 votes
1 answer

Smoothed analysis to compare algorithms

Has there been any research using smoothed analysis to compare approximation algorithms that have the same approximation ratio? Any research that compares algorithms using smoothed analysis would be ...
Andrius Vaicenavicius's user avatar
1 vote
0 answers

Average case or beyond worse case analysis for non-convex optimization procedures?

I'm not sure if this is a well-formed question or not, but I thought I would ask to see if anyone is aware of related literature. It is known that global optimization of non-convex functions is NP-...
Jake Shellman's user avatar
12 votes
1 answer

Smoothed analysis of approximation algorithms

Smoothed analysis has been applied many times to understand the runtime of exact algorithms for many problems like linear programming and k-means. There are fairly general results in this realm, for ...
Aaron Schild's user avatar
16 votes
2 answers

Paradigms for complexity analysis of algorithms

Worst-case and average case analysis are well-known measures for the complexity of an algorithm. Recently smoothed analysis has emerged as another paradigm to explain why some algorithms which are ...
Opt's user avatar
  • 1,311
9 votes
1 answer

Smoothed Analysis: If a Problem has Pseudopolynomial Complexity, is it in Smooth P?

I have been facinated by the extraordinary explosion in Smoothed Analysis and was struck by a assertion in the paper Smoothed Analysis of Integer Programming. This stated that Integer Linear ...
Zelah 02's user avatar
  • 1,578
51 votes
6 answers

Complexity of the simplex algorithm

What is the upper bound on the simplex algorithm for finding a solution to a Linear Program? How would I go about finding a proof for such a case? It seems as though the worst case is if each vertex ...
shuttle87's user avatar
  • 627