A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
From MaRDI portal
(Redirected from Publication:5202502)
Recommendations
Cited in
(20)- A modified layered-step interior-point algorithm for linear programming
- On the condition numbers for polyhedra in Karmarkar's form
- Pivot rules for linear programming: A survey on recent theoretical developments
- A primal-dual interior point method whose running time depends only on the constraint matrix
- A note on properties of condition numbers
- A simple proof of a primal affine scaling method
- Identifying an optimal basis in linear programming
- Condition numbers for polyhedra with real number data
- A norm bound for projections with complex weights
- New characterizations of Hoffman constants for systems of linear constraints
- Improved complexity results on solving real-number linear feasibility problems
- scientific article; zbMATH DE number 5004702 (Why is no real title available?)
- A study of the dual affine scaling continuous trajectories for linear programming
- An affine scaling method using a class of differential barrier functions: primal approach
- Norm estimations for perturbations of the weighted Moore-Penrose inverse
- An efficient search direction for linear programming problems
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
- An easily computable upper bound on the Hoffman constant for homogeneous inequality systems
- Duality of Hoffman constants
- 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
This page was built for publication: A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202502)
