Smoothed Analysis of Interior-Point Algorithms: Condition Number
John Dunagan, Daniel A. Spielman, Shang-Hua Teng
cs.DSarXiv:cs/0302011
Abstract
We show that the smoothed complexity of the logarithm of Renegar's condition number is O(log (n/sigma)).
Create a lesson
Related papers
Fast FPRAS for the Permanent
Xiaoyu Chen, Heng Guo, Eric Vigoda et al.
Large-Scale Trade-Off Curve Computation for Incentive Allocation with Cardinality and Matroid Constraints
Yu Cong, Chao Xu, Yi Zhou
An Ω( n m) Information-Theoretic Lower Bound for Randomized Online Set Cover
Roie Levin
Optimal Simulated Annealing for Partition Function Estimation
Heng Guo, Hongyang Liu, Xiongxin Yang et al.
Emergency Vertex Cover
Eric Angel, Evangelos Bampas, Evripidis Bampis et al.
Exact Greedy Influence Maximization in Linear Time on Bounded-Treewidth Graphs
Matic Požar