Sufficient matrices: properties, generating and testing

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Corrector-predictor methods for sufficient linear complementarity problems
On the complexity of computing the handicap of a sufficient matrix
Determining the handicap of a sufficient matrix
The principal pivoting method revisited
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
A polynomial path-following interior point algorithm for general linear complementarity problems
EP theorem for dual linear complementarity problems
Sufficient matrices and the linear complementarity problem
A unified approach to interior point algorithms for linear complementary problems
The linear complementarity problem, sufficient matrices, and the criss- cross method
EP theorems and linear complementarity problems
Co-NP-completeness of some matrix classification problems
Pivot versus interior point methods: Pros and cons
A polyhedral branch-and-cut approach to global optimization
On a subclass of $P_ 0$
Criteria for sufficient matrices
$P_ *$-matrices are just sufficient
On sufficient properties of sufficient matrices
Predictor-corrector interior-point algorithm for $P_*(\kappa)$-linear complementarity problems based on a new type of algebraic equivalent transformation technique
A predictor-corrector interior-point algorithm for $P_\ast (\kappa )$-horizontal linear complementarity problem
Polynomial interior-point algorithm for $P_\ast(\kappa)$ horizontal linear complementarity problems
A path to the Arrow-Debreu competitive market equilibrium
Some generalizations of positive definiteness and monotonicity
A strongly polynomial rounding procedure yielding a maximally complementary solution for $P_*(\kappa)$ linear complementarity problems
Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
Some generalizations of the criss-cross method for quadratic programming
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
Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
New criss-cross type algorithms for linear complementarity problems with sufficient matrices
Existence of an Equilibrium for a Competitive Economy
Unified approach of interior-point algorithms for $P_* (\kappa)$-LCPs using a new class of algebraically equivalent transformations
A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems

This page was built for publication: Sufficient matrices: properties, generating and testing