Algorithm for solving the set-valued variational inequality problem in Euclidean space

MaRDI QIDQ4908849zbMATH OpenFDO

Authors Aviv Gibali

Publication date 7 March 2013

Full work available at URL http://www.yokohamapublishers.jp/online2/oppjo/vol9/p61.html

zbMATH Keywords

maximal monotone mappingparamonotone mappingprojection methodseparating hyperplanesvariational inequality

Mathematics Subject Classification ID

Set-valued operators (47H04) Monotone operators and generalizations (47H05) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Equations with nonlinear hysteresis operators (47J40) Nonlinear programming (90C30)

Recommendations

• A projection-proximal point algorithm for solving generalized variational inequalities
• An algorithm for solving the variational inequality problem over the fixed point set of a quasi-nonexpansive operator in Euclidean space
• A projection algorithm for non-monotone variational inequalities
• An algorithm for generalized variational inequality with pseudomonotone mapping
• A double projection algorithm for multi-valued variational inequalities and a unified framework of the method

Cited in

(2)

• A new self-adaptive CQ algorithm with an application to the LASSO problem
• Self-adaptive gradient projection algorithms for variational inequalities involving non-Lipschitz continuous operators

This page was built for publication: Algorithm for solving the set-valued variational inequality problem in Euclidean space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4908849)