Two new self-adaptive projection methods for variational inequality problems (Q1609083): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0898-1221(02)00116-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083669856 / rank
 
Normal rank

Latest revision as of 10:21, 30 July 2024

scientific article
Language Label Description Also known as
English
Two new self-adaptive projection methods for variational inequality problems
scientific article

    Statements

    Two new self-adaptive projection methods for variational inequality problems (English)
    0 references
    0 references
    0 references
    15 August 2002
    0 references
    The usual variational inequality Find \(u^* \in K\) such that \[ F(u^*)^T (v-u^*) \geq 0 \quad\text{for any }v \in K, \] where \(K\) is a nonempty closed convex subset of \(R^n\), is considered. The function \(F\) is continuous and satisfies only some generalized monotonicity assumptions. The new methods use only function evaluations and projections onto the set \(K\), together with a line search strategy. Numerical tests are reported.
    0 references
    self-adaptive projection methods
    0 references
    numerical examples
    0 references
    variational inequality
    0 references
    line search strategy
    0 references
    0 references
    0 references
    0 references

    Identifiers