Pages that link to "Item:Q2757589"
From MaRDI portal
The following pages link to Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming (Q2757589):
Displaying 9 items.
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- Probabilistic analysis of a differential equation for linear programming (Q652446) (← links)
- Conditioning of random conic systems under a general family of input distributions (Q1029212) (← links)
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming (Q1589768) (← links)
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points (Q1804652) (← links)
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636) (← 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)
- New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction (Q5949888) (← links)
