A self-adaptive projection and contraction method for monotone symmetric linear variational inequalities. (Q1609034): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the basic theorem of complementarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative scheme for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4746741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for a class of linear variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linear projection equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact implicit methods for monotone general variational inequalities / rank
 
Normal rank

Revision as of 12:36, 4 June 2024

scientific article
Language Label Description Also known as
English
A self-adaptive projection and contraction method for monotone symmetric linear variational inequalities.
scientific article

    Statements

    A self-adaptive projection and contraction method for monotone symmetric linear variational inequalities. (English)
    0 references
    0 references
    0 references
    15 August 2002
    0 references
    A modification of projection methods in finite dimensional spaces for symmetric variational inequalities of type \((x-x^*)^T(Hx^*+C)\geq0,\,\forall x\in\Omega\) with nonempty closed convex set \(\Omega\) is considered. A known iterative method which bases on an equivalent fixed point formulation \(x=P_\Omega(x-\beta(Hx+c))\) is modified by replacing the constant \(\beta>0\) by parameters \(\beta_k\) which are adapted to the iterates \(x^k\). A convergence theorem is established and numerical examples are given. However, in the experiments the earlier restrictions for the choice of \(\beta_k\) are relaxed.
    0 references
    0 references
    symmetric variational inequality
    0 references
    projection method
    0 references
    contraction method
    0 references
    adaptive parameters
    0 references
    projection methods
    0 references
    numerical examples
    0 references