Interior point methods are not worse than simplex
From MaRDI portal
Cites work
- A Deterministic Linear Program Solver in Current Matrix Multiplication Time
- A mathematical view of interior-point methods in convex optimization
- A modified layered-step interior-point algorithm for linear programming
- A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm
- A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A primal-dual interior point method whose running time depends only on the constraint matrix
- A randomized polynomial-time simplex algorithm for linear programming
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
- A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
- A strongly polynomial algorithm for approximate Forster transforms and its application to halfspace learning
- A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming
- Applied linear algebra and matrix analysis
- Bipartite matching in nearly-linear time on moderately dense graphs
- Condition numbers for polyhedra with real number data
- Curvature integrals and iteration complexities in SDP and symmetric cone programs
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Faster sparse minimum cost flow by electrical flow localization
- Fully dynamic electrical flows: sparse maxflow faster than Goldberg-Rao
- Generalized Inverses of Linear Transformations
- Geometric algorithms and combinatorial optimization
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 5485557 (Why is no real title available?)
- scientific article; zbMATH DE number 193258 (Why is no real title available?)
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
- Is binary encoding appropriate for the problem-language relationship?
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial
- Mathematical problems for the next century
- Maximum flow and minimum-cost flow in almost-linear time
- Minimum cost flows, MDPs, and ℓ 1 -regression in nearly linear time for dense instances
- Navigating central path with electrical flows: from flows to matchings, and back
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- No self-concordant barrier interior point method is strongly polynomial
- Numerical methods for solving linear least squares problems
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On computing the determinant in small parallel time using a small number of processors
- On Rank-Revealing Factorisations
- On the complexity of following the central path of linear programs by linear extrapolation. II
- On the existence and computation of rank-revealing LU factorizations
- Path finding methods for linear programming: solving linear programs in \(\widetilde{O}(\sqrt{rank})\) iterations and faster algorithms for maximum flow
- Path-Following Methods for Linear Programming
- Rang revealing QR factorizations
- Short-step methods are not strongly polynomial-time
- Smoothed analysis of algorithms
- Solving linear programs in the current matrix multiplication time
- Solving tall dense linear programs in nearly linear time
- Systems of distinct representatives and linear algebra
- The entropic barrier is n-self-concordant
- The payment scheduling problem
- Universal Barrier Is n-Self-Concordant
- What Tropical Geometry Tells Us about the Complexity of Linear Programming
Cited in
(3)
This page was built for publication: Interior point methods are not worse than simplex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6911552)
