Subspace Accelerated Matrix Splitting Algorithms for Asymmetric and Symmetric Linear Complementarity Problems (Q2866190): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055780016 / rank
 
Normal rank

Latest revision as of 01:27, 20 March 2024

scientific article
Language Label Description Also known as
English
Subspace Accelerated Matrix Splitting Algorithms for Asymmetric and Symmetric Linear Complementarity Problems
scientific article

    Statements

    Subspace Accelerated Matrix Splitting Algorithms for Asymmetric and Symmetric Linear Complementarity Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 December 2013
    0 references
    linear complementarity problem
    0 references
    quadratic programming
    0 references
    iterative methods
    0 references
    matrix splitting
    0 references
    two-phase methods
    0 references
    fixed-point iteration
    0 references
    projected search
    0 references
    algorithms
    0 references
    global convergence
    0 references
    numerical experiments
    0 references
    American options pricing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references