Pages that link to "Item:Q4294728"
From MaRDI portal
The following pages link to Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming (Q4294728):
Displaying 22 items.
- Probabilistic analysis of a differential equation for linear programming (Q652446) (← links)
- Probabilistic analysis of condition numbers for linear programming (Q700762) (← links)
- On strata of degenerate polyhedral cones. II: Relations between condition measures (Q964924) (← links)
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
- On strata of degenerate polyhedral cones. I: Condition and distance to strata (Q1027575) (← links)
- On the condition numbers for polyhedra in Karmarkar's form (Q1306351) (← links)
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming (Q1589768) (← links)
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
- Condition numbers for polyhedra with real number data (Q1924613) (← 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)
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> (Q2709447) (← links)
- Probabilistic analysis of an infeasible-interior-point algorithm for linear programming (Q2757589) (← links)
- Extreme points of well-posed polytopes (Q3446581) (← links)
- A Data-Independent Distance to Infeasibility for Linear Conic Systems (Q4959838) (← links)
- Deepest point of a polyhedron and linear programming (Q4981863) (← links)
- (Q5020878) (← links)
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization (Q5076724) (← links)
- Rescaling Algorithms for Linear Conic Feasibility (Q5119854) (← links)
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems (Q5870377) (← links)
- On the identification of the optimal partition for semidefinite optimization (Q5882391) (← links)
