Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
From MaRDI portal
Publication:4294728
Recommendations
- Probabilistic analysis of an infeasible-interior-point algorithm for linear programming
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming
- scientific article; zbMATH DE number 2154409
- On the probabilistic complexity of finding an approximate solution for linear programming
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure.
Cited in
(25)- Multicommodity network flows: A survey. II: Solution methods
- Probabilistic analysis of an infeasible-interior-point algorithm for linear programming
- On strata of degenerate polyhedral cones. II: Relations between condition measures
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
- scientific article; zbMATH DE number 2154409 (Why is no real title available?)
- Deepest point of a polyhedron and linear programming
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
- Extreme points of well-posed polytopes
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Probabilistic analysis of condition numbers for linear programming
- A note on probability assignments in estimating the time to solve linear programs
- A data-independent distance to infeasibility for linear conic systems
- A randomized center path method for a class of linear programming problems
- Rescaling algorithms for linear conic feasibility
- On the identification of the optimal partition for semidefinite optimization
- On strata of degenerate polyhedral cones. I: Condition and distance to strata
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- Probabilistic analysis of a differential equation for linear programming
- Condition numbers for polyhedra with real number data
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure.
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- On the condition numbers for polyhedra in Karmarkar's form
- On the probabilistic complexity of finding an approximate solution for linear programming
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming
This page was built for publication: Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294728)
