An improved proximal-based decomposition method for structured monotone variational inequalities

DOI10.1007/S10483-007-1213-YMaRDI QIDQ940504zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

decompositionproximalstructured variational inequalitiesinexact criterion

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Variational and other types of inequalities involving nonlinear operators (general) (47J20)

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

Cites work

• scientific article; zbMATH DE number 45081 (Why is no real title available?)
• scientific article; zbMATH DE number 679861 (Why is no real title available?)
• A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A new approximate proximal point algorithm for maximal monotone operator
• A new inexact alternating directions method for monotone variational inequalities
• A proximal-based deomposition method for compositions method for convex minimization problems
• A variable-penalty alternating directions method for convex optimization
• Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• Application of the alternating direction method of multipliers to separable convex programming problems
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Convex Analysis
• Entropic proximal decomposition methods for convex programs and variational inequalities
• Nonlinear proximal decomposition method for convex programming
• Projection methods for variational inequalities with application to the traffic assignment problem
• Transportation Network Policy Modeling with Goal Targets and Generalized Penalty Functions

Cited in

(12)

• Alternating Projection-Proximal Methods for Convex Programming and 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
• scientific article; zbMATH DE number 6135093 (Why is no real title available?)
• An inexact proximal decomposition method for variational inequalities with separable structure
• Decomposition method with a variable parameter for a class of monotone variational inequality problems
• Entropic proximal decomposition methods for convex programs and variational inequalities
• A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
• Progressive decoupling of linkages in monotone variational inequalities and convex optimization
• A modified proximal-based decomposition method for variational inequalities
• 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

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)