Extragradient methods for solving nonconvex variational inequalities (Q631917): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cam.2010.10.052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969575230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5737280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Variational Inequalities and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: General variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4379284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation schemes for general variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some developments in general variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative schemes for nonconvex variational inequalities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4666763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection methods for nonconvex variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit iterative methods for nonconvex variational Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extragradient algorithm for solving general nonconvex variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an implicit method for nonconvex variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5252549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some iterative methods for nonconvex variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some aspects of variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local differentiability of distance functions / rank
 
Normal rank

Latest revision as of 21:39, 3 July 2024

scientific article
Language Label Description Also known as
English
Extragradient methods for solving nonconvex variational inequalities
scientific article

    Statements

    Extragradient methods for solving nonconvex variational inequalities (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 March 2011
    0 references
    This paper is devoted to the study of a new class of variational inequalities (the nonconvex variational inequalities), and for a new class of nonconvex sets (uniformly prox-regular set \(K_r\)). This class of uniformly prox-regular sets have played an important part in many nonconvex applications (optimization, dynamic systems and differential inclusions). For a nonlinear operator \(T\) the authors establish the equivalence between the variational inequality: \(<Tu, v-u> \geq 0\), \([u,v] \in K_r\) (the nonconvex variational inequality, NVI) and the fixed point problem using the projection operator technique. Here \(u \in K_r\) is a solution of the nonconvex variational inequality if and only if \(u \in K_r\) satisfies the relation: \(u=P_{K_r} [u - \rho T u]\), where \(P_{K_r}\) is the projection of \(H\) (a real Hilbert space) onto the uniformly prox-regular set \(K_r\), which implies that NVI is equivalent to the fixed point problem. This equivalent formulation is used to suggest and analyze the implicit iterative method for solving NVI. If the operator \(T\) is pseudomonotone, and \( u \in K_r\) is a solution of NVI and \(u_{n+1}\) is the approximate solution obtained from Algorithm 2 (For a given \(u_\diamond \in H\) find the approximate solution \(u_{n+1}\) by using the iterative schemes: \(u_{n+1} = P_{K_r} [u_n - \rho T u_{n+1}], n = 0,1, ...)\) one then has: \(\|u-u_{n+1}\|^2 \leq \|u - u_n\|^2 - \|u_{n+1} - u_n \|^2\), \(\rho >0\), and \(\lim_{n \rightarrow \infty} u_n = u\), if \(H\) is a finite dimensional space. The authors use the idea of Noor to prove that the convergence of the extragradient method requires only pseudo-monotonicity, which is a weaker condition than monotonicity. Thus proposed result represents an improvement and refinement of the known results.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Variational inequalities
    0 references
    Monotone operators
    0 references
    Iterative method
    0 references
    Projection operator
    0 references
    Convergence
    0 references
    Algorithm
    0 references
    0 references