Sufficient matrices: properties, generating and testing
From MaRDI portal
Publication:6596334
Recommendations
Cites work
- scientific article; zbMATH DE number 3972641 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 3523317 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 1971713 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems
- A path to the Arrow-Debreu competitive market equilibrium
- A polyhedral branch-and-cut approach to global optimization
- 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 strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems
- A unified approach to interior point algorithms for linear complementary problems
- Co-NP-completeness of some matrix classification problems
- Corrector-predictor methods for sufficient linear complementarity problems
- Criteria for sufficient matrices
- Determining the handicap of a sufficient matrix
- EP theorem for dual linear complementarity problems
- EP theorems and linear complementarity problems
- Existence of an Equilibrium for a Competitive Economy
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices
- On a subclass of \(P_ 0\)
- On sufficient properties of sufficient matrices
- On the complexity of computing the handicap of a sufficient matrix
- Pivot versus interior point methods: Pros and cons
- Polynomial interior point algorithms for general linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- Some generalizations of positive definiteness and monotonicity
- Some generalizations of the criss-cross method for quadratic programming
- Sufficient matrices and the linear complementarity problem
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- The principal pivoting method revisited
- The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
- Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations
- \(P_ *\)-matrices are just sufficient
This page was built for publication: Sufficient matrices: properties, generating and testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596334)
