A primal-dual interior point method whose running time depends only on the constraint matrix

Recommendations

Cites work

Cited in

(43)

Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
A complementarity partition theorem for multifold conic systems
On Chubanov's Method for Linear Programming
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
A simpler and tighter redundant Klee-Minty construction
On circuit diameter bounds via circuit imbalances
Analysis of some interior point continuous trajectories for convex programming
Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
An analogue of the Klee-Walkup result for sonnevend's curvature of the central path
Improved complexity results on solving real-number linear feasibility problems
A strongly polynomial algorithm for approximate Forster transforms and its application to halfspace learning
Further development of multiple centrality correctors for interior point methods
A modified layered-step interior-point algorithm for linear programming
Spectrally constrained optimization
The convergent generalized central paths for linearly constrained convex programming
scientific article; zbMATH DE number 1489800 (Why is no real title available?)
Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
An update-and-stabilize framework for the minimum-norm-point problem
New characterizations of Hoffman constants for systems of linear constraints
On the condition numbers for polyhedra in Karmarkar's form
Some aspects of studying an optimization or decision problem in different computational models
A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming
Linear programming, complexity theory and elementary functional analysis
Fixed interval scheduling: models, applications, computational complexity and algorithms
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
A note on properties of condition numbers
Central path curvature and iteration-complexity for redundant Klee-Minty cubes
Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
Probabilistic analysis of condition numbers for linear programming
On the probabilistic complexity of finding an approximate solution for linear programming
The central curve in linear programming
Log-Barrier Interior Point Methods Are Not Strongly Polynomial
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
The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties
On circuit diameter bounds via circuit imbalances
On strata of degenerate polyhedral cones. I: Condition and distance to strata
Minimizing convex functions with rational minimizers
A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
An accelerated interior point method whose running time depends only on \(A\) (extended abstract)
Examples of ill-behaved central paths in convex optimization
What Tropical Geometry Tells Us about the Complexity of Linear Programming

This page was built for publication: A primal-dual interior point method whose running time depends only on the constraint matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352307)