Large-step algorithm for linear complementarity problem with new search direction
From MaRDI portal
Cites work
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- A long-step interior-point algorithm for symmetric cone Cartesian P_ ()-HLCP
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems
- A new algorithm for solving self-dual linear optimization problems
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- A unified approach to interior point algorithms for linear complementary problems
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Corrector-predictor methods for sufficient linear complementarity problems
- EP theorem for dual linear complementarity problems
- Equivaence between different formulations of the linear complementarity promblem
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- New interior point algorithms in linear programming
- On a subclass of \(P_ 0\)
- On the complexity of computing the handicap of a sufficient matrix
- On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
- Polynomial interior point algorithms for general linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Primal-dual entropy-based interior-point algorithms for linear optimization
- Sufficient matrices and the linear complementarity problem
- Sufficient matrices: properties, generating and testing
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
- \(P_ *\)-matrices are just sufficient
This page was built for publication: Large-step algorithm for linear complementarity problem with new search direction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907545)
