Smoothed Analysis of Interior-Point Algorithms: Condition Number

Details Smoothed Analysis of Interior-Point Algorithms: Condition Number Smoothed Analysis of Interior-Point Algorithms: Condition Number

2003-02-10

arxiv.org/abs/cs/0302011v2

Computer Science

Data Structures and Algorithms

Fixed it up quite a bit

Scientific paper

We show that the smoothed complexity of the logarithm of Renegar's condition
number is O(log (n/sigma)).

Affiliated with

Also associated with

No associations

Rating

Smoothed Analysis of Interior-Point Algorithms: Condition Number does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Smoothed Analysis of Interior-Point Algorithms: Condition Number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Smoothed Analysis of Interior-Point Algorithms: Condition Number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-73062