The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Convex Optimization, Game Theory, and Variational Inequality Theory
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Cognitive radio: brain-empowered wireless communications
Haykin, S. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.839380 · Cited by 11,916
(1994) · Cited by 5,513
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Monderer, D., & Shapley, L. S. (1996) · Games and Economic Behavior · doi:10.1006/game.1996.0044 · Cited by 3,543
Finite-Dimensional Variational Inequalities and Complementarity Problems
(2004) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b97544 · Cited by 3,521
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Supermodularity and Complementarity
Topkis, D. M. (2011) · Princeton University Press eBooks · doi:10.1515/9781400822539 · Cited by 2,138
Distributed multiuser power control for digital subscriber lines
Yu, W., Ginis, G., & Cioffi, J. M. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.1007390 · Cited by 855
Distributed interference compensation for wireless networks
Huang, J., Berry, R. A., & Honig, M. L. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.872889 · Cited by 726
Cited by
Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
Scutari, G., Facchinei, F., Song, P., Palomar, D. P., & Pang, J.-S. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2293126 · Cited by 338
Self-citationCloud/Fog Computing Resource Management and Pricing for Blockchain Networks
Xiong, Z., Feng, S., Wang, W., Niyato, D., Wang, P., & Han, Z. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2871706 · Cited by 303
An operator splitting approach for distributed generalized Nash equilibria computation
Yi, P., & Pavel, L. (2019) · Automatica · doi:10.1016/j.automatica.2019.01.008 · Cited by 271
Metadata
- Authors
- Scutari, G., Palomar, D., Facchinei, F., & Pang, J.-S.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2010-05
- Volume
- 27
- Issue
- 3
- Pages
- 35-49
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W2103965104
- Cited by
- 376
- References
- 24
- FWCI
- 15.54
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Convex Optimization, Game Theory, and Variational Inequality Theory. https://app.cochat.ai/papers/10.1109/msp.2010.936021
- The paper
- Scutari, G., Palomar, D., Facchinei, F., & Pang, J.-S. (2010). Convex Optimization, Game Theory, and Variational Inequality Theory. IEEE Signal Processing Magazine. https://doi.org/10.1109/msp.2010.936021
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.