Polynomial convergence of two higher order interior-point methods for P_*()-LCP in a wide neighborhood of the central path

Recommendations

Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
A new second-order corrector interior-point algorithm for $P_\ast (\kappa)$-LCP
A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with $O(\sqrt nL)$-iteration complexity
A quadratically convergent $\text{O}((\kappa +1)\sqrt n L)$-iteration algorithm for the $P_ *(\kappa)$-matrix linear complementarity problem

Cites work

scientific article; zbMATH DE number 1017028 (Why is no real title available?)
A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
A new $O(\sqrt nL)$ iteration large-update primal-dual interior-point method for second-order cone programming
A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with $O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})$ iteration complexity
A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
A penalized Fischer-Burmeister NCP-function
A polynomial path-following interior point algorithm for general linear complementarity problems
A predictor-corrector interior-point algorithm for $P_\ast (\kappa )$-horizontal linear complementarity problem
A quadratically convergent $O(\sqrt n\;L)$-iteration algorithm for linear programming
A unified approach to interior point algorithms for linear complementarity problems: A summary
A wide neighborhood infeasible-interior-point method with arc-search for linear programming
An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
Determining the handicap of a sufficient matrix
EP theorem for dual linear complementarity problems
EP theorems and linear complementarity problems
High order infeasible-interior-point methods for solving sufficient linear complementarity problems
Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
NP-completeness of the linear complementarity problem
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP
On a subclass of $P_ 0$
On quadratic and $O(\sqrt{n}L)$ convergence of a predictor-corrector algorithm for LCP
On the complexity of computing the handicap of a sufficient matrix
Polynomial interior point algorithms for general linear complementarity problems
Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
Sufficient matrices and the linear complementarity problem
The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems

Cited in

(12)

A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
A high-order Dikin-type algorithm for $P_* (\kappa)$-LCPs in a wide neighborhood of the central path
A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
A strongly polynomial rounding procedure yielding a maximally complementary solution for $P_*(\kappa)$ linear complementarity problems
An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
Polynomial convergence of a predictor-corrector interior-point algorithm for LCP
A new search direction for full-Newton step interior-point method in $P_*(\kappa)$-HLCP
A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
High order long-step methods for solving linear complementarity problems
A new second-order corrector interior-point algorithm for $P_\ast (\kappa)$-LCP

This page was built for publication: Polynomial convergence of two higher order interior-point methods for $P_*(\kappa)$-LCP in a wide neighborhood of the central path

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