Polynomial interior point algorithms for general linear complementarity problems
From MaRDI portal
Recommendations
- A polynomial path-following interior point algorithm for general linear complementarity problems
- EP theorems and linear complementarity problems
- An extension of interior point potential reduction algorithm to solve general lcps
- scientific article; zbMATH DE number 653034
- scientific article; zbMATH DE number 6020688
Cited in
(28)- Strongly polynomial algorithm for a class of combinatorial LCPs
- EP theorems and linear complementarity problems
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- A corrector-predictor interior-point method with new search direction for linear optimization
- A strongly polynomial rounding procedure yielding a maximally complementary solution for P_*() linear complementarity problems
- A new polynomial interior-point algorithm for the Cartesian \(P_\ast(\kappa)\) second-order cone linear complementarity problem
- Sufficient weighted complementarity problems
- Some LCPs solvable in strongly polynomial time with Lemke's algorithm
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
- scientific article; zbMATH DE number 2195332 (Why is no real title available?)
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- Unified approach of interior-point algorithms for P_* ()-LCPs using a new class of algebraically equivalent transformations
- New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
- Sufficient matrices: properties, generating and testing
- Large-step algorithm for linear complementarity problem with new search direction
- Multiple faces of optimization. A tribute to Tamás Terlaky on his 70th birthday
- New predictor-corrector interior-point algorithm with AET function having inflection points
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
- New method for determining search directions for interior-point algorithms in linear optimization
- An extension of interior point potential reduction algorithm to solve general lcps
- A polynomial path-following interior point algorithm for general linear complementarity problems
This page was built for publication: Polynomial interior point algorithms for general linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867373)
