Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Smoothed Analysis of Renegar’s Condition Number for Linear Programming
John Dunagan
,
Daniel A. Spielman
,
Shang‐Hua Teng
Type:
Article
Publication Date:
2002-01-01
Citations:
35
Share
Similar Works
Action
Title
Year
Authors
+
Robust Smoothed Analysis of a Condition Number for Linear Programming
2008
Peter Bürgisser
Dennis Amelunxen
+
Robust Smoothed Analysis of a Condition Number for Linear Programming
2008
Peter Bürgisser
Dennis Amelunxen
+
PDF
Chat
Robust smoothed analysis of a condition number for linear programming
2010
Peter Bürgisser
Dennis Amelunxen
+
PDF
Chat
Smoothed analysis of condition numbers and complexity implications for linear programming
2009
John Dunagan
Daniel A. Spielman
Shang‐Hua Teng
+
Robust smoothed analysis of a condition number for linear programming
2012
BürgisserPeter
AmelunxenDennis
+
Smoothed analysis of the perceptron algorithm for linear programming
2002
Avrim Blum
John Dunagan
+
PDF
Chat
Smoothed analysis of termination of linear programming algorithms
2003
Daniel A. Spielman
Shang‐Hua Teng
+
Smoothed Analysis of Interior-Point Algorithms: Condition Number
2003
John Dunagan
Daniel A. Spielman
Shang‐Hua Teng
+
Smoothed analysis of the condition number under low-rank perturbations.
2020
Rikhav Shah
Sandeep Silwal
+
Smoothed analysis of the condition number under low-rank perturbations
2020
Rikhav Shah
Sandeep Silwal
+
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
1993
Ilan Adler
Ron Shamir
+
A Friendly Smoothed Analysis of the Simplex Method
2017
Daniel Dadush
Sophie Huiberts
+
A Friendly Smoothed Analysis of the Simplex Method
2017
Daniel Dadush
Sophie Huiberts
+
On the Average Condition of Random Linear Programs
2013
Dennis Cheung
Felipe Cucker
+
PDF
Chat
Some perturbation theory for linear programming
1994
James Renegar
+
PDF
Chat
Rescaled Pure Greedy Algorithm for convex optimization
2019
Zheming Gao
Guergana Petrova
+
PDF
Chat
Lipschitz Modulus of the Optimal Value in Linear Programming
2018
M. J. Gisbert
M. J. Cánovas
J. Parra
F. Javier Toledo
+
Probabilistic Analysis of Condition Numbers for Linear Programming
2002
Dennis Cheung
Felipe Cucker
+
Smoothed Analysis of the Condition Number Under Low-Rank Perturbations.
2021
Rikhav Shah
Sandeep Silwal
+
A Randomized Nonlinear Rescaling Method in Large-Scale Constrained Convex Optimization
2020
Bo Wei
William B. Haskell
Sixiang Zhao
Works That Cite This (23)
Action
Title
Year
Authors
+
PDF
Chat
Coverage processes on spheres and condition numbers for linear programming
2010
Peter Bürgisser
Felipe Cucker
Martin Lötz
+
A simple polynomial-time rescaling algorithm for solving linear programs
2007
John Dunagan
Santosh Vempala
+
Conditioning of Random Conic Systems Under a General Family of Input Distributions
2008
Raphael Hauser
Tobias Müller
+
Robust Smoothed Analysis of a Condition Number for Linear Programming
2008
Peter Bürgisser
Dennis Amelunxen
+
Smoothed analysis of algorithms
2004
Daniel A. Spielman
Shang‐Hua Teng
+
PDF
Chat
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
2006
Arvind Sankar
Daniel A. Spielman
Shang‐Hua Teng
+
Smoothed analysis
2009
Daniel A. Spielman
Shang‐Hua Teng
+
PDF
Chat
Solving linear programs with finite precision: II. Algorithms
2005
Dennis Cheung
Felipe Cucker
+
PDF
Chat
Some remarks on the condition number of a real random square matrix
2003
Juan A. Cuesta‐Albertos
Mario Wschebor
+
PDF
Chat
Smooth Analysis of the Condition Number and the Least Singular Value
2009
Terence Tao
Van Vu
Works Cited by This (24)
Action
Title
Year
Authors
+
Condition number complexity of an elementary algorithm for resolving a conic linear system
1997
Marina A. Epelman
Robert M. Freund
+
PDF
Chat
Interior Point Methods: Current Status and Future Directions
2000
Robert M. Freund
Shinji Mizuno
+
An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations
1989
Clóvis C. Gonzaga
+
PDF
Chat
Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
2000
Marina A. Epelman
Robert M. Freund
+
Implementation of Interior Point Methods for Large Scale Linear Programming
1996
Erling D. Andersen
Jacek Gondzio
Csaba Mészáros
Xiaojie Xu
+
PDF
Chat
Linear programming, complexity theory and elementary functional analysis
1995
James Renegar
+
Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
2000
Javier Peña
+
PDF
Chat
Incorporating Condition Measures into the Complexity Theory of Linear Programming
1995
James Renegar
+
PDF
Chat
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
1993
Shinji Mizuno
Michael J. Todd
Yinyu Ye
+
Smoothed analysis of the perceptron algorithm for linear programming
2002
Avrim Blum
John Dunagan