\(P_ *\)-matrices are just sufficient
From MaRDI portal
Publication:1913648
zbMath0851.15015MaRDI QIDQ1913648
Publication date: 26 November 1996
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Hermitian, skew-Hermitian, and related matrices (15B57)
Related Items
Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP, Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation, Sufficient weighted complementarity problems, Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems, Criss-cross methods: A fresh view on pivot algorithms, Trajectory-following methods for large-scale degenerate convex quadratic programming, A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems, A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem, EP theorems and linear complementarity problems, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, On the complexity of computing the handicap of a sufficient matrix, Determining the handicap of a sufficient matrix, A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP, A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems, A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem, The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems, Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem, Corrector-predictor methods for sufficient linear complementarity problems, A field guide to the matrix classes found in the literature of the linear complementarity problem, Sufficient matrices belong to \(L\)., A polynomial path-following interior point algorithm for general linear complementarity problems, Column sufficient tensors and tensor complementarity problems, Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP, An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function, Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems., On sufficient properties of sufficient matrices, EP theorem for dual linear complementarity problems, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP, New characterizations of row sufficient matrices, Sufficiency of linear transformations on Euclidean Jordan algebras, \(d\)-orientation sequences for continuous functions and nonlinear complementarity problems, An alternative theorem for generalized variational inequalities and solvability of nonlinear quasi-\(P^M_*\)-complementarity problems, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity, On column competent matrices and linear complementarity problem, Quasi-P\(_*\)-maps, P(\(\tau,\alpha,\beta\))-maps, exceptional family of elements, and complementarity problems, An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function, A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function
