Linear Programming in O([n3/ln n]L) Operations

DOI10.1137/S1052623497323194zbMath0955.90085OpenAlexW2063753743MaRDI QIDQ4702310

Kurt M. Anstreicher

Publication date: 24 November 1999

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623497323194

zbMATH Keywords

linear programmingconjugate gradient methodinterior point algorithmpartial updating

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items (14)

Deciding probabilistic automata weak bisimulation: theory and practice ⋮ An efficient basis update for asymptotic linear programming ⋮ Haifa 1985 conference on matrix theory ⋮ On incremental approximate saddle-point computation in zero-sum matrix games ⋮ A canonical form for pencils of matrices with applications to asymptotic linear programs ⋮ Context-based unsupervised ensemble learning and feature ranking ⋮ Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ₁ minimization ⋮ Bridging gap between standard and differential polynomial approximation: The case of bin-packing ⋮ Improved approximation algorithms for the maximum happy vertices and edges problems ⋮ Approximation schemes for job shop scheduling problems with controllable processing times ⋮ Bounds and Approximations for Multistage Stochastic Programs ⋮ Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse ⋮ On solving the densestk-subgraph problem on large graphs ⋮ \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization

This page was built for publication: Linear Programming in O([n3/ln n]L) Operations