Some Goldstein's type methods for co-coercive variant variational inequalities (Q617635): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5333460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of functions having Lipschitz continuous first partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternate minimization gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering and Economic Applications of Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving non-additive traffic assignment problems: a descent method for co-coercive 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: Q4719205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact implicit methods for monotone general variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adaptive projection method for co-coercive variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of two kinds of prediction-correction methods for monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative algorithm for the variational inequality problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of korpelevich’s method for variational inequalities with a new search strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modification of the extra-gradient method for solving variational inequalities and certain optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified descent method for co-coercive variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal point algorithms for general variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Goldstein's type method for a class of variant variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying geometric solution framework and complexity analysis for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of projection methods: Application to the decomposition of affine variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network economics: a variational inequality approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton method for a class of quasi-variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Generalization of a Normal Map and Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities / rank
 
Normal rank

Latest revision as of 17:16, 3 July 2024

scientific article
Language Label Description Also known as
English
Some Goldstein's type methods for co-coercive variant variational inequalities
scientific article

    Statements

    Some Goldstein's type methods for co-coercive variant variational inequalities (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2011
    0 references
    This paper is devoted to the study of the so-called variant variational inequality VVI \((F, \Omega)\), (which is closely related to VI \((\Omega, F)\): find a vector \(u \in \Omega\) such that: \((v-u)^T F(u) \geq 0, \forall v \in \Omega\), where \(\Omega\) is a nonempty closed convex set in \(\mathbb R^n\) and \(F\) is a mapping from \(\mathbb R^n\) into itself) of the form. Find a vector \(u \in \mathbb R^n\) such that (1) \(F(u) \in \Omega, (v-F(u))^T u \geq 0, \forall v \in \Omega\). It is assumed that the solution set \(S^*\) of (1) is nonempty. Since, in general, it is not possible to identify analytic solutions of VI \((\Omega, F)\) and VVI \((\Omega, F)\) without specific structures of \(F\) and \(\Omega\), the researchers are particularly interested in designing numerical algorithms to approach to VI \((\Omega, F)\) and VVI \((\Omega, F)\), subject to certain criteria. The monotonicity of \(F\) plays a crucial role in designing numerical algorithms for solving VI \((\Omega, F)\) and VVI \((\Omega, F)\). With the restrictions that \(F\) is Lipschitz continuous and strongly monotone, the authors use the classical Goldstein method to get iteratively updates \(u^K\) (starting from any \(u^o \in \Omega\)) according to the formula (2) \(u^{K+1} = P_\Omega [u^K - \beta_K F(u^K)]\), where \(\beta_K > 0\) is the scaling parameter and \(P_\Omega (v)\) denotes the projection of \(v\) onto \(\Omega\) under the Euclidean norm, i.e. \(P_\Omega (v) = arg \min \{\|u-v\|: u \in \Omega \}\). The Goldstein method converges globally with linear speed under the condition (3) \(0 < \beta_L \leq \inf^\infty_{K=1} \{\beta_K\} \leq \sup^\infty_{K=1} \{\beta_K\} \leq \beta_U < \frac{2s}{L^2}\). To solve VVI \((\Omega, F)\) with Lipschitz continuous and strongly monotone \(F\), an extended Goldstein method is presented. The corresponding scheme is: (4) (He-Goldstein method) \(u^{k+1} = u^K-\frac{1}{\beta_K}\{F(u^K)- P_\Omega [F(u^K)-\beta_Ku^k]\}\). Similar to (3) the scaling parameters \(\{\beta_K\}\) in (4) should be restricted in certain ranges, relying on the Lipschitz constant and the strong monotonicity constant \(F\). In addition to the monotonicity, the co-coercivity of \(F\) also arises widely in the VI and VVI models in various applications. The goal of this paper is to give the affirmative answer to the natural question if it is possible to extend the Goldstein type method (4) to solve the co-coercive VVI \(( \Omega,F)\). Main result: The authors show that when the involved co-coercive modulus of VVI is known, the Goldstein method can be improved by identifying a refined step-size at each iteration. Hence, an improved Goldstein type method is proposed for co-coercive VVIs with known co-coercive modulus. Finally, some numerical results to verify the efficiency of the proposed Goldstein type methods for VVIs, are also presented.
    0 references
    0 references
    co-coercive
    0 references
    Goldstein method
    0 references
    optimal step-size
    0 references
    variant variational inequality
    0 references
    Lipschitz and strongly monotone operators
    0 references
    convergence
    0 references
    numerical results
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers