Pages that link to "Item:Q5930724"
From MaRDI portal
The following pages link to Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems (Q5930724):
Displaying 13 items.
- Probabilistic analysis of condition numbers for linear programming (Q700762) (← links)
- Probabilistic complexity analysis for linear problems in bounded domains (Q757053) (← links)
- Smoothed analysis of complex conic condition numbers (Q864180) (← links)
- A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms (Q930345) (← links)
- Conditioning of random conic systems under a general family of input distributions (Q1029212) (← links)
- On the expected condition number of linear programming problems (Q1402168) (← links)
- Solving linear programs with finite precision. I: Condition numbers and random programs (Q1424293) (← links)
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636) (← links)
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis (Q1945037) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
