Sufficient matrices and the linear complementarity problem
From MaRDI portal
Publication:1121805
DOI10.1016/0024-3795(89)90463-1zbMath0674.90092OpenAlexW1970000960WikidataQ56504900 ScholiaQ56504900MaRDI QIDQ1121805
Publication date: 1989
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(89)90463-1
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Hermitian, skew-Hermitian, and related matrices (15B57)
Related Items
On the solution and complexity of a generalized linear complementarity problem, Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation, Sufficient weighted complementarity problems, Sparse solutions of linear complementarity problems, On a subclass of \(P_ 0\), A new path-following algorithm for nonlinear \(P_*\) complementarity problems, More results on column sufficiency property in Euclidean Jordan algebras, Properties of some matrix classes based on principal pivot transform, Criteria for sufficient matrices, Criss-cross methods: A fresh view on pivot algorithms, AN IMPROVED BLOCK MODULUS METHOD FOR DIAGONALLY DOMINANT LINEAR COMPLEMENTARITY PROBLEMS, Sign reversing and matrix classes, A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems, T. Parthasarathy's contributions to complementarity problems: a survey, The problem of projecting the origin of Euclidean space onto the convex polyhedron, EP theorems and linear complementarity problems, On solving parametric multiobjective quadratic programs with parameters in general locations, The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces, A full-Newton step interior-point method for monotone weighted linear complementarity problems, Modulus-based iterative methods for constrained ℓ p – ℓ q minimization, THE RELAXATION TWO-SWEEP MODULUS-BASED MATRIX SPLITTING ITERATION METHODS FOR A CLASS OF NONLINEAR COMPLEMENTARITY PROBLEMS, On generalizations of positive subdefinite matrices and the linear complementarity problem, Equivaence between different formulations of the linear complementarity promblem, A class of linear complementarity problems solvable in polynomial time, Total dual integrality of the linear complementarity problem, A unified approach to interior point algorithms for linear complementarity problems: A summary, Complementarity properties of singular \(M\)-matrices, Two characterizations of sufficient matrices, On a global projection-type error bound for the linear complementarity problem, Determining the handicap of a sufficient matrix, The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems, On the classes of fully copositive and fully semimonotone matrices, Lipschitz continuity of the solution mapping of symmetric cone complementarity problems, Corrector-predictor methods for sufficient linear complementarity problems, A field guide to the matrix classes found in the literature of the linear complementarity problem, The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP, Sufficient matrices belong to \(L\)., Partially and totally asynchronous algorithms for linear complementarity problems, A polynomial path-following interior point algorithm for general linear complementarity problems, A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones, Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path, Column sufficient tensors and tensor complementarity problems, More on positive subdefinite matrices and the linear complementarity problem, Solution structures of tensor complementarity problem, Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP, Integrated assessment of energy policies: decomposing top-down and bottom-up, G-coupling functions, The linear complementarity problem, sufficient matrices, and the criss- cross method, On sufficient properties of sufficient matrices, On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones, 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, The principal pivoting method revisited, \(P_ c\)-matrices and the linear complementarity problem, New criss-cross type algorithms for linear complementarity problems with sufficient matrices, Sufficiency of linear transformations on Euclidean Jordan algebras, Une procédure de purification pour les problèmes de complémentarité linéaire, monotones, 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, Quasi-P\(_*\)-maps, P(\(\tau,\alpha,\beta\))-maps, exceptional family of elements, and complementarity problems, Strict feasibility conditions in nonlinear complementarity problems, On weak generalized positive subdefinite matrices and the linear complementarity problem, Notes on sufficient matrices, Interior-point algorithms for global optimization, A procedure for the one-parametric linear complementarity problem, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, On the transpose of a pseudomonotone matrix and the LCP, Investigations of a certain class of linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some generalizations of positive definiteness and monotonicity
- Complementary pivot theory of mathematical programming
- The Jacobian matrix and global univalence of mappings
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- A constructive characterization ofQ o-matrices with nonnegative principal minors
- On solving linear complementarity problems as linear programs
- Existence of solution rays for linear complementarity problems with Z-matrices
- Algorithms for the Generalized Linear Complementarity Problem with a Vertical BlockZ-Matrix
- Note on a Fundamental Theorem in Quadratic Programming
- Bimatrix Equilibrium Points and Mathematical Programming
- Nonlinear Programs with Positively Bounded Jacobians
- A Probelm in Linear Inequalities
- On a Problem in Linear Inequalities
- The Linear Complementarity Problem
- On the basic theorem of complementarity
- The Linear Complementarity Problem
- A Partition Theorem for Euclidean n-Space
