Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
From MaRDI portal
Publication:4294728
DOI10.1287/moor.19.1.38zbMath0799.90086OpenAlexW2143349594MaRDI QIDQ4294728
Publication date: 18 May 1994
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.19.1.38
Related Items (19)
Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. ⋮ On the identification of the optimal partition for semidefinite optimization ⋮ Extreme points of well-posed polytopes ⋮ A lower bound on the number of iterations of long-step primal-dual linear programming algorithms ⋮ Condition numbers for polyhedra with real number data ⋮ Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs ⋮ Rescaling Algorithms for Linear Conic Feasibility ⋮ Unnamed Item ⋮ A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems* ⋮ Probabilistic analysis of a differential equation for linear programming ⋮ On strata of degenerate polyhedral cones. II: Relations between condition measures ⋮ On the probabilistic complexity of finding an approximate solution for linear programming ⋮ Probabilistic analysis of condition numbers for linear programming ⋮ A Data-Independent Distance to Infeasibility for Linear Conic Systems ⋮ Deepest point of a polyhedron and linear programming ⋮ On strata of degenerate polyhedral cones. I: Condition and distance to strata ⋮ Average number of iterations of some polynomial interior-point -- algorithms for linear programming ⋮ On the condition numbers for polyhedra in Karmarkar's form ⋮ Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
This page was built for publication: Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
