An improved proximal-based decomposition method for structured monotone variational inequalities
DOI10.1007/S10483-007-1213-YzbMATH Open1231.47063OpenAlexW2007016195MaRDI QIDQ940504FDOQ940504
Authors: Min Li, Xiaoming Yuan 
Publication date: 1 September 2008
Published in: Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10483-007-1213-y
Recommendations
- scientific article; zbMATH DE number 6135093
- An inexact proximal decomposition method for variational inequalities with separable structure
- A modified proximal-based decomposition method for variational inequalities
- A proximal decomposition algorithm for variational inequality problems.
- On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Variational and other types of inequalities involving nonlinear operators (general) (47J20)
Cites Work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Convex Analysis
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Application of the alternating direction method of multipliers to separable convex programming problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- Projection methods for variational inequalities with application to the traffic assignment problem
- Title not available (Why is that?)
- A new inexact alternating directions method for monotone variational inequalities
- Title not available (Why is that?)
- A new approximate proximal point algorithm for maximal monotone operator
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- A variable-penalty alternating directions method for convex optimization
- Entropic proximal decomposition methods for convex programs and variational inequalities
- Transportation Network Policy Modeling with Goal Targets and Generalized Penalty Functions
- Nonlinear proximal decomposition method for convex programming
Cited In (12)
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- Decomposition method with a variable parameter for a class of monotone variational inequality problems
- Title not available (Why is that?)
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
- A new implementable prediction-correction method for monotone variational inequalities with separable structure
- On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities
- An inexact proximal decomposition method for variational inequalities with separable structure
- Progressive decoupling of linkages in monotone variational inequalities and convex optimization
- A modified proximal-based decomposition method for variational inequalities
- A proximal decomposition algorithm for variational inequality problems.
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Entropic proximal decomposition methods for convex programs and variational inequalities
This page was built for publication: An improved proximal-based decomposition method for structured monotone variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q940504)
