Determining the handicap of a sufficient matrix

DOI10.1016/0024-3795(95)00703-2zbMath0878.65054OpenAlexW2012502841MaRDI QIDQ677143

Hannu Väliaho

Publication date: 5 January 1998

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(95)00703-2

zbMATH Keywords

linear complementarity probleminterior point methodcomplexity boundsufficient matrixhandicapP-matrices

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (8)

Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation ⋮ Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path ⋮ On the complexity of computing the handicap of a sufficient matrix ⋮ A polynomial path-following interior point algorithm for general linear complementarity problems ⋮ Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path ⋮ Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems. ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ \(d\)-orientation sequences for continuous functions and nonlinear complementarity problems

Cites Work

• Unnamed Item
• The principal pivoting method revisited
• Sufficient matrices and the linear complementarity problem
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• On a subclass of \(P_ 0\)
• \(P_ *\)-matrices are just sufficient
• On Nonlinear Fractional Programming
• On inverting partitioned matrices

This page was built for publication: Determining the handicap of a sufficient matrix