A new implementable prediction-correction method for monotone variational inequalities with separable structure (Q2319291): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58917775, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Projection methods for variational inequalities with application to the traffic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5618030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5440593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new inexact alternating directions method for monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4470274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate proximal-extragradient type method for monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved prediction-correction method for monotone variational inequalities with separable operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of linearized proximal alternating direction methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact alternating direction method for solving a class of structured variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized proximal-point-based prediction-correction method for variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4906152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal-based deomposition method for compositions method for convex minimization problems / rank
 
Normal rank

Latest revision as of 04:47, 20 July 2024

scientific article
Language Label Description Also known as
English
A new implementable prediction-correction method for monotone variational inequalities with separable structure
scientific article

    Statements

    A new implementable prediction-correction method for monotone variational inequalities with separable structure (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2019
    0 references
    Summary: The monotone variational inequalities capture various concrete applications arising in many areas. In this paper, we develop a new prediction-correction method for monotone variational inequalities with separable structure. The new method can be easily implementable, and the main computational effort in each iteration of the method is to evaluate the proximal mappings of the involved operators. At each iteration, the algorithm also allows the involved subvariational inequalities to be solved in parallel. We establish the global convergence of the proposed method. Preliminary numerical results show that the new method can be competitive with Chen's proximal-based decomposition method in [\textit{G. Chen} and \textit{M. Teboulle}, Math. Program. 64, No. 1 (A), 81--101 (1994; Zbl 0823.90097)].
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references