The strong convergence of prediction-correction and relaxed hybrid steepest-descent method for variational inequalities (Q2015692): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58916977, #quickstatements; #temporary_batch_1711565664090
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On semidefinite linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of hybrid steepest-descent methods for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis of modified hybrid steepest-descent methods with variable parameters for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a general projection algorithm for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-step relaxed hybrid steepest-descent methods for variational inequalities / 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: Q3517221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5402636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connections among constrained continuous and combinatorial vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong convergence of Krasnoselskii and Mann's type sequences for one-parameter nonexpansive semigroups without Bochner integrals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient implementation of a modified and relaxed hybrid steepest-descent method for a type of variational inequality / 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: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4346042 / 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: Strong convergence of three-step relaxed hybrid steepest-descent methods for variational inequalities / rank
 
Normal rank

Latest revision as of 16:40, 8 July 2024

scientific article
Language Label Description Also known as
English
The strong convergence of prediction-correction and relaxed hybrid steepest-descent method for variational inequalities
scientific article

    Statements

    The strong convergence of prediction-correction and relaxed hybrid steepest-descent method for variational inequalities (English)
    0 references
    0 references
    0 references
    23 June 2014
    0 references
    Summary: We establish the strong convergence of prediction-correction and relaxed hybrid steepest-descent method (PRH method) for variational inequalities under some suitable conditions that simplify the proof. And it is to be noted that the proof is different from the previous results and also is not similar to the previous results. More importantly, we design a set of practical numerical experiments. The results demonstrate that the PRH method under some descent directions is more slightly efficient than that of the modified and relaxed hybrid steepest-descent method, and the PRH Method under some new conditions is more efficient than that under some old conditions.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references