Verification for existence of solutions of linear complementarity problems
From MaRDI portal
Publication:5929743
DOI10.1016/S0024-3795(99)00272-4zbMath0977.65056MaRDI QIDQ5929743
Maretsugu Yamasaki, Xiaojun Chen, Yukihiro Shogenji
Publication date: 3 July 2001
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
numerical resultsverification methodalgorithms with automatic result verificationlinear complementarity problems
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Algorithms with automatic result verification (65G20)
Related Items (5)
Principal minors. I: A method for computing all the principal minors of a matrix ⋮ The unique solution of the absolute value equations ⋮ IGAOR and multisplitting IGAOR methods for linear complementarity problems ⋮ A note on the unique solution of linear complementarity problem ⋮ The radius of metric regularity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rigorous global search: continuous problems
- On homogeneous and self-dual algorithms for LCP
- A verification method for solutions of nonsmooth equations
- Numerical validation of solutions of linear complementarity problems
- Smoothing methods for convex inequalities and linear complementarity problems
- The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Computational complexity of LCPs associated with positive definite symmetric matrices
- On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
- Efficient Numerical Validation of Solutions of Nonlinear Systems
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Expansion and estimation of the range of nonlinear functions
- Iterative methods for linear complementarity problems with upperbounds on primary variables
- A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm
This page was built for publication: Verification for existence of solutions of linear complementarity problems