By Topic

Convex Optimization, Game Theory, and Variational Inequality Theory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)

In this article, we have provided a unified view of some basic theoretical foundations and main techniques in convex optimization, game theory, and VI theory. We put special emphasis on the generality of the VI framework, showing how it allows to tackle several interesting problems in nonlinear analysis, classical optimization, and equilibrium programming. In particular, we showed the relevance of the VI theory in studying Nash and GNE problems. The first part of the article was devoted to provide the (basic) theoretical tools and methods to analyze some fundamental issues of an equilibrium problem, such as the existence and uniqueness of a solution and the design of iterative distributed algorithms along with their convergence properties. The second part of the article made these theoretical results practical by showing how the VI framework can be successfully applied to solve several challenging equilibrium problems in ad hoc wireless (peer-to-peer wired) networks, in the emerging field of CR networks, and in multihop communication networks. We hope that this introductory article would serve as a good starting point for readers to apply VI theory and methods in their applications, as well as to locate specific references either in applications or theory.

Published in:

Signal Processing Magazine, IEEE  (Volume:27 ,  Issue: 3 )