A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A wide neighborhood infeasible-interior-point method with arc-search for linear programming
An $O(\sqrt nL)$ wide neighborhood interior-point algorithm for semidefinite optimization
Corrector-predictor methods for sufficient linear complementarity problems
An $O(\sqrt nL)$ iteration primal-dual second-order corrector algorithm for linear programming
On the complexity of computing the handicap of a sufficient matrix
Determining the handicap of a sufficient matrix
New method for determining search directions for interior-point algorithms in linear optimization
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality
A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
NP-completeness of the linear complementarity problem
Sufficient matrices and the linear complementarity problem
A unified approach to interior point algorithms for linear complementary problems
Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with $O(\sqrt nL)$-iteration complexity
On a subclass of $P_ 0$
$P_ *$-matrices are just sufficient
A corrector-predictor interior-point method with new search direction for linear optimization
A new $O(\sqrt{n}L)$-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
Polynomial interior-point algorithm for $P_\ast(\kappa)$ horizontal linear complementarity problems
A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
Equivaence between different formulations of the linear complementarity promblem
Engineering and Economic Applications of Complementarity Problems
A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP
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
Equilibrium Points of Bimatrix Games
An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP