New improved error bounds for the linear complementarity problem (Q1340062): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Error Bounds for the Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for nondegenerate monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global error bounds for monotone affine variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for the linear complementarity problem with a P-matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Newton methods for the nonlinear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuity properties of polyhedral multifunctions / rank
 
Normal rank

Latest revision as of 10:49, 23 May 2024

scientific article
Language Label Description Also known as
English
New improved error bounds for the linear complementarity problem
scientific article

    Statements

    New improved error bounds for the linear complementarity problem (English)
    0 references
    0 references
    0 references
    17 January 1996
    0 references
    For the linear complementarity problem \[ \text{LCP}(M, q): Mx+ q\geq 0,\;x\geq 0,\;x(Mx+ q)= 0, \] with \(M\) an \(R_0\)-matrix, i.e. the \(\text{LCP}(M, 0)\) has zero as its unique solution, new error bounds are given. Various residuals used in these error bounds are discussed. In some sense the ``best'' residual is proposed.
    0 references
    0 references
    0 references
    error bounds
    0 references