Algorithms for Bilevel Pseudomonotone Variational Inequality Problems
Bui Van Dinh(vandinhbgmail.com)
Abstract: We propose easily implementable algorithms for minimizing the norm with pseudomonotone variational inequality constraints. This bilevel problem arises in the Tikhonov regularization method for pseudomonone variational inequalities. Since the solution set of the lower variational inequality is not given explicitly, the available methods of mathematical programming and variational inequality can not be applied directly. With these algorithms we want to give an answer to a question posed in the ref .
Keywords: Bilevel variational inequality, pseudomonotonicity, projection method, Armjio linesearch, convergence.
Category 1: Convex and Nonsmooth Optimization
Category 2: Complementarity and Variational Inequalities
Citation: UNPUBLISHED: 1)report number: 1; 2)Institution address: 1. Bui Van Dinh, Department of Mathematics, Le Quy Don Technical University, No 100 Hoang Quoc Viet road, Hanoi, Vietnam; 2. Le Dung Muu, Institute of Mathematics, Hanoi, Vietnam; 3).Month/Year: 1/2012.
Entry Submitted: 01/12/2012
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|