Multiuser Optimization: Distributed Algorithms and Error Analysis

Traditionally, a multiuser problem is a constrained optimization problem characterized by a set of users, an objective given by a sum of user-specific utility functions, and a collection of linear constraints that couple the user decisions. The users do not share the information about their utilitie...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on optimization Vol. 21; no. 3; pp. 1046 - 1081
Main Authors: Koshal, Jayash, Nedić, Angelia, Shanbhag, Uday V.
Format: Journal Article
Language:English
Published: Philadelphia Society for Industrial and Applied Mathematics 01.07.2011
Subjects:
Algorithms
Approximation
Error analysis
Optimization
Utility functions
ISSN:1052-6234, 1095-7189
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Traditionally, a multiuser problem is a constrained optimization problem characterized by a set of users, an objective given by a sum of user-specific utility functions, and a collection of linear constraints that couple the user decisions. The users do not share the information about their utilities, but do communicate values of their decision variables. The multiuser problem is to maximize the sum of the user-specific utility functions subject to the coupling constraints, while abiding by the informational requirements of each user. In this paper, we focus on generalizations of convex multiuser optimization problems where the objective and constraints are not separable by user and instead consider instances where user decisions are coupled, both in the objective and through nonlinear coupling constraints. To solve this problem, we consider the application of gradient-based distributed algorithms on an approximation of the multiuser problem. Such an approximation is obtained through a Tikhonov regularization and is equipped with estimates of the difference between the optimal function values of the original problem and its regularized counterpart. In the algorithmic development, we consider constant step-length primal-dual and dual schemes in which the iterate computations are distributed naturally across the users; i.e., each user updates its own decision only. Convergence in the primal-dual space is provided in limited coordination settings, which allows for differing step lengths across users as well as across the primal and dual space. We observe that a generalization of this result is also available when users choose their regularization parameters independently from a prescribed range. An alternative to primal-dual schemes can be found in dual schemes that are analyzed in regimes where approximate primal solutions are obtained through a fixed number of gradient steps. Per-iteration error bounds are provided in such regimes, and extensions are provided to regimes where users independently choose their regularization parameters. Our results are supported by a case study in which the proposed algorithms are applied to a multiuser problem arising in a congested traffic network. [PUBLICATION ABSTRACT]
AbstractList Traditionally, a multiuser problem is a constrained optimization problem characterized by a set of users, an objective given by a sum of user-specific utility functions, and a collection of linear constraints that couple the user decisions. The users do not share the information about their utilities, but do communicate values of their decision variables. The multiuser problem is to maximize the sum of the user-specific utility functions subject to the coupling constraints, while abiding by the informational requirements of each user. In this paper, we focus on generalizations of convex multiuser optimization problems where the objective and constraints are not separable by user and instead consider instances where user decisions are coupled, both in the objective and through nonlinear coupling constraints. To solve this problem, we consider the application of gradient-based distributed algorithms on an approximation of the multiuser problem. Such an approximation is obtained through a Tikhonov regularization and is equipped with estimates of the difference between the optimal function values of the original problem and its regularized counterpart. In the algorithmic development, we consider constant step-length primal-dual and dual schemes in which the iterate computations are distributed naturally across the users; i.e., each user updates its own decision only. Convergence in the primal-dual space is provided in limited coordination settings, which allows for differing step lengths across users as well as across the primal and dual space. We observe that a generalization of this result is also available when users choose their regularization parameters independently from a prescribed range. An alternative to primal-dual schemes can be found in dual schemes that are analyzed in regimes where approximate primal solutions are obtained through a fixed number of gradient steps. Per-iteration error bounds are provided in such regimes, and extensions are provided to regimes where users independently choose their regularization parameters. Our results are supported by a case study in which the proposed algorithms are applied to a multiuser problem arising in a congested traffic network. [PUBLICATION ABSTRACT]
Author Shanbhag, Uday V.
Nedić, Angelia
Koshal, Jayash
Author_xml – sequence: 1
  givenname: Jayash
  surname: Koshal
  fullname: Koshal, Jayash
– sequence: 2
  givenname: Angelia
  surname: Nedić
  fullname: Nedić, Angelia
– sequence: 3
  givenname: Uday V.
  surname: Shanbhag
  fullname: Shanbhag, Uday V.
BookMark eNptkD9PwzAQxS1UJNrCwDeIxMQQeraTOGaLSvkjFXWBOXISB1wlcTk7Q_n0uBQxIIbTnU6_d7r3ZmQy2EETcknhhlIuFiBBCKDATsiUgkxjQXM5OcwpizPGkzMyc24LALnM8ikpnsfOm9FpjDY7b3rzqbyxw210Z5xHU41eN1HRvVk0_r13kRqaaIVoMSoG1e2dcefktFWd0xc_fU5e71cvy8d4vXl4WhbruGap8HFasabiVRJKg2Kaa8aZamoueSZlE5aaVpAnWtC6EYkUtaraNoM2USBzAD4nV8e7O7Qfo3a-3NoRwxOuDMaZSDhLaaAWR6pG6xzqtqyN_7bkUZmupFAecip_cwqK6z-KHZpe4f4f9gvA8mkN
CitedBy_id crossref_primary_10_1109_TCST_2018_2827990
crossref_primary_10_1109_MSP_2020_2968813
crossref_primary_10_1109_TAC_2017_2662019
crossref_primary_10_1109_LCSYS_2024_3411931
crossref_primary_10_1109_LCSYS_2022_3186631
crossref_primary_10_1109_TAC_2017_2760284
crossref_primary_10_1109_TWC_2014_2364573
crossref_primary_10_1109_TCST_2023_3254137
crossref_primary_10_1007_s43684_021_00004_0
crossref_primary_10_1109_TAC_2021_3057601
crossref_primary_10_1109_TAC_2012_2215413
crossref_primary_10_1109_TCNS_2022_3203467
crossref_primary_10_1109_TCNS_2024_3488516
crossref_primary_10_1109_TAC_2014_2298712
crossref_primary_10_1016_j_apenergy_2023_121612
crossref_primary_10_1109_LCOMM_2014_2381245
crossref_primary_10_1049_iet_cta_2014_1161
crossref_primary_10_1109_LCSYS_2022_3230321
crossref_primary_10_1109_TSG_2019_2943540
crossref_primary_10_1137_23M1558677
crossref_primary_10_1109_TSP_2013_2291221
crossref_primary_10_1016_j_epsr_2022_108357
crossref_primary_10_1109_TCNS_2024_3425633
crossref_primary_10_1109_TITS_2020_3015122
crossref_primary_10_1109_TAC_2018_2849946
crossref_primary_10_1137_22M1488077
crossref_primary_10_1016_j_jclepro_2022_131935
crossref_primary_10_1109_TAC_2019_2927925
crossref_primary_10_1007_s11768_024_00223_9
crossref_primary_10_1016_j_apenergy_2022_120484
crossref_primary_10_1109_TSIPN_2025_3600760
crossref_primary_10_1109_JSYST_2023_3253966
crossref_primary_10_1109_TCNS_2021_3068372
crossref_primary_10_1109_TSP_2019_2896112
crossref_primary_10_1016_j_acha_2017_07_007
crossref_primary_10_1109_TMC_2023_3265646
crossref_primary_10_1016_j_trb_2018_07_005
crossref_primary_10_1049_iet_rpg_2020_0043
crossref_primary_10_1109_TSP_2022_3209010
crossref_primary_10_1109_JSYST_2021_3071998
crossref_primary_10_1109_TCNS_2024_3462536
crossref_primary_10_1109_TCST_2022_3143115
crossref_primary_10_1109_TSG_2025_3539529
crossref_primary_10_1109_TSP_2017_2679690
crossref_primary_10_1137_15M1008956
crossref_primary_10_1109_TCNS_2020_3024485
crossref_primary_10_1109_TPDS_2016_2636210
crossref_primary_10_1109_TPWRS_2017_2741920
crossref_primary_10_1109_TSIPN_2024_3485508
crossref_primary_10_1287_trsc_2021_1100
crossref_primary_10_1109_TAC_2022_3169955
crossref_primary_10_1109_TPWRS_2019_2948978
crossref_primary_10_1109_ACCESS_2023_3341295
crossref_primary_10_1109_TAC_2020_2996178
crossref_primary_10_1109_TITS_2022_3175668
crossref_primary_10_1109_TSG_2016_2571982
crossref_primary_10_1137_17M1118609
crossref_primary_10_1088_1755_1315_661_1_012026
crossref_primary_10_1007_s10915_025_02934_w
crossref_primary_10_1109_TPWRS_2025_3528752
crossref_primary_10_1007_s10957_022_02062_7
crossref_primary_10_1080_10556788_2012_676756
crossref_primary_10_1109_TCNS_2019_2929648
crossref_primary_10_1016_j_automatica_2021_109926
crossref_primary_10_1109_TCNS_2022_3203366
crossref_primary_10_1109_TII_2021_3132940
crossref_primary_10_1109_TCST_2017_2771307
crossref_primary_10_1007_s10957_015_0758_0
crossref_primary_10_1186_1687_1499_2012_338
crossref_primary_10_1016_j_ifacol_2021_04_203
crossref_primary_10_1007_s10479_016_2209_1
crossref_primary_10_1016_j_apenergy_2020_115583
crossref_primary_10_1007_s10107_019_01365_4
crossref_primary_10_1109_LCSYS_2018_2889963
crossref_primary_10_1109_TSIPN_2021_3051292
crossref_primary_10_1109_TAC_2017_2750103
crossref_primary_10_1109_TSG_2023_3315207
crossref_primary_10_1109_TAC_2017_2673240
crossref_primary_10_1049_iet_gtd_2020_0415
crossref_primary_10_1016_j_apenergy_2018_07_034
crossref_primary_10_1016_j_arcontrol_2024_100941
crossref_primary_10_1002_rnc_6041
crossref_primary_10_1016_j_trb_2016_09_016
crossref_primary_10_1109_TSG_2017_2783894
crossref_primary_10_1007_s10957_021_01836_9
crossref_primary_10_1080_0305215X_2025_2450691
crossref_primary_10_1016_j_ifacol_2018_12_040
crossref_primary_10_1109_TSG_2020_3010866
crossref_primary_10_2514_1_G006532
crossref_primary_10_1137_20M1371063
crossref_primary_10_1109_TCNS_2021_3112762
crossref_primary_10_1080_10556788_2023_2189713
crossref_primary_10_1109_LCSYS_2021_3086441
crossref_primary_10_1109_LCSYS_2020_3044542
Cites_doi 10.1007/s10107-004-0552-5
10.1109/90.811451
10.1137/S0363012994268655
10.1109/JPROC.2006.887322
10.1561/1300000007
10.1109/TAC.2011.2137590
10.1137/S1052623497325107
10.1137/080716542
10.1007/BF01585112
10.1007/s10107-006-0034-z
10.1057/palgrave.jors.2600523
ContentType Journal Article
Copyright Copyright © 2011 Society for Industrial and Applied Mathematics
Copyright_xml – notice: Copyright © 2011 Society for Industrial and Applied Mathematics
DBID AAYXX
CITATION
3V.
7RQ
7WY
7WZ
7X2
7XB
87Z
88A
88F
88I
88K
8AL
8FE
8FG
8FH
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
CCPQU
D1I
DWQXO
FRNLG
F~G
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
KB.
L.-
L6V
LK8
M0C
M0K
M0N
M1Q
M2O
M2P
M2T
M7P
M7S
MBDVC
P5Z
P62
PATMY
PDBOC
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
PYCSY
Q9U
U9A
DOI 10.1137/090770102
DatabaseName CrossRef
ProQuest Central (Corporate)
Career & Technical Education Database (ProQuest)
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
Agricultural Science Collection
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Biology Database (Alumni Edition)
Military Database (Alumni Edition)
Science Database (Alumni Edition)
Telecommunications (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Natural Science Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Research Library (Alumni)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Agricultural & Environmental Science Collection
ProQuest Central Essentials - QC
Biological Science Collection
ProQuest Central
Business Premium Collection
Technology Collection
Natural Science Collection
ProQuest One Community College
ProQuest Materials Science Collection
ProQuest Central
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
ProQuest Research Library
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
Materials Science Database
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
Biological Sciences
ABI/INFORM Global
Agricultural Science Database
Computing Database
Military Database (ProQuest)
Research Library
Science Database
Telecommunications Database
Biological Science Database
Engineering Database
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Environmental Science Database
Materials Science Collection
Proquest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
Environmental Science Collection
ProQuest Central Basic
DatabaseTitle CrossRef
Agricultural Science Database
ProQuest Business Collection (Alumni Edition)
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest Military Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest Telecommunications
ProQuest One Applied & Life Sciences
Natural Science Collection
Biological Science Collection
ProQuest Central (New)
Engineering Collection
Career and Technical Education (Alumni Edition)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest Biological Science Collection
ProQuest One Academic Eastern Edition
Agricultural Science Collection
ProQuest Technology Collection
ProQuest Telecommunications (Alumni Edition)
Biological Science Database
ProQuest Business Collection
Environmental Science Collection
ProQuest Career and Technical Education
ProQuest One Academic UKI Edition
Environmental Science Database
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
ProQuest One Academic Middle East (New)
Materials Science Collection
ProQuest Central (Alumni Edition)
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Natural Science Collection
ProQuest Biology Journals (Alumni Edition)
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
Agricultural & Environmental Science Collection
Materials Science Database
ProQuest Research Library
ABI/INFORM Complete (Alumni Edition)
ProQuest Materials Science Collection
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest Military Collection (Alumni Edition)
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList Agricultural Science Database
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 1095-7189
EndPage 1081
ExternalDocumentID 3009048381
10_1137_090770102
GroupedDBID -~X
.4S
.DC
123
4.4
7RQ
7WY
7X2
7XC
88I
8CJ
8FE
8FG
8FH
8FL
8G5
8V8
AALVN
AASXH
AAYXX
ABDBF
ABDPE
ABJCF
ABKAD
ABMZU
ABUWG
ACGFO
ACGOD
ACIWK
ACPRK
ACUHS
ADBBV
AEMOZ
AENEX
AFFHD
AFFNX
AFKRA
AFRAH
AHQJS
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ANXRF
ARAPS
ARCSS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
BPHCQ
CCPQU
CITATION
CS3
CZ9
D1I
D1J
D1K
DQ2
DU5
DWQXO
EAP
EBR
EBS
EBU
EDO
EJD
EMK
EST
ESX
F5P
FRNLG
GNUQQ
GUQSH
H13
HCIFZ
H~9
I-F
K1G
K6-
K60
K6V
K6~
K7-
KB.
KC.
L6V
LK5
LK8
M0C
M0K
M1Q
M2O
M2P
M7P
M7R
M7S
P1Q
P2P
P62
PATMY
PDBOC
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PTHSS
PYCSY
RJG
RNS
RSI
TH9
TN5
TUS
TWZ
YNT
3V.
7XB
88A
88K
8AL
8FK
JQ2
L.-
M0N
M2T
MBDVC
PKEHL
PQEST
PQUKI
PRINS
Q9U
U9A
ID FETCH-LOGICAL-c257t-5b2db3b4b3be0a2e3e232adc393699dbe0e1b084e71cd7497cabff60f4a098003
IEDL.DBID M7P
ISICitedReferencesCount 131
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000295405600019&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1052-6234
IngestDate Fri Jul 25 10:44:27 EDT 2025
Sat Nov 29 06:10:57 EST 2025
Tue Nov 18 21:35:33 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c257t-5b2db3b4b3be0a2e3e232adc393699dbe0e1b084e71cd7497cabff60f4a098003
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 1372743251
PQPubID 666300
PageCount 36
ParticipantIDs proquest_journals_1372743251
crossref_citationtrail_10_1137_090770102
crossref_primary_10_1137_090770102
PublicationCentury 2000
PublicationDate 20110701
PublicationDateYYYYMMDD 2011-07-01
PublicationDate_xml – month: 07
  year: 2011
  text: 20110701
  day: 01
PublicationDecade 2010
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle SIAM journal on optimization
PublicationYear 2011
Publisher Society for Industrial and Applied Mathematics
Publisher_xml – name: Society for Industrial and Applied Mathematics
References R6
R7
R9
R30
R20
R23
R13
R24
R16
R15
Korpelevich G. M. (R12) 1976; 12
R18
R29
R17
R19
R1
References_xml – ident: R18
  doi: 10.1007/s10107-004-0552-5
– ident: R16
  doi: 10.1109/90.811451
– ident: R24
  doi: 10.1137/S0363012994268655
– ident: R7
  doi: 10.1109/JPROC.2006.887322
– ident: R23
  doi: 10.1561/1300000007
– ident: R30
  doi: 10.1109/TAC.2011.2137590
– ident: R6
  doi: 10.1137/S1052623497325107
– volume: 12
  start-page: 747
  issn: 0424-7388
  year: 1976
  ident: R12
  publication-title: Ekonom. i Mat. Metody
– ident: R29
  doi: 10.1137/S0363012994268655
– ident: R1
  doi: 10.1137/080716542
– ident: R20
  doi: 10.1007/BF01585112
– ident: R13
  doi: 10.1109/90.811451
– ident: R15
  doi: 10.1109/90.811451
– ident: R19
  doi: 10.1007/s10107-006-0034-z
– ident: R9
  doi: 10.1057/palgrave.jors.2600523
– ident: R17
  doi: 10.1109/90.811451
SSID ssj0008968
Score 2.4356372
Snippet Traditionally, a multiuser problem is a constrained optimization problem characterized by a set of users, an objective given by a sum of user-specific utility...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 1046
SubjectTerms Algorithms
Approximation
Error analysis
Optimization
Utility functions
Title Multiuser Optimization: Distributed Algorithms and Error Analysis
URI https://www.proquest.com/docview/1372743251
Volume 21
WOSCitedRecordID wos000295405600019&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: 7WY
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M0C
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: P5Z
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Agricultural Science Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M0K
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/agriculturejournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Biological Science Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M7P
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/biologicalscijournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Career & Technical Education Database (ProQuest)
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: 7RQ
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/career
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: K7-
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M7S
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Environmental Science Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: PATMY
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/environmentalscience
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Materials Science Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: KB.
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/materialsscijournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Military Database (ProQuest)
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M1Q
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/military
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: BENPR
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Research Library
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M2O
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/pqrl
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M2P
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NT9swFH_iY4ftsAHbNKCrIsSBiyGJnTrmMhVWNAlaMmB87BL5K4AEbZd0-_vn57rdkNAuO-QnObEUy7Hf83uxfz-AbS1kx3YUJzrTGWEyt0Qaxl2oIjNepZnhXovg8oQPBvn1tShCwq0J2ypnNtEbajPSmCPfS6jztIw6d_xp_IOgahT-XQ0SGouwjCwJ1G_dK-aWOBfhKFyWEufmWWAWSpDTxwWFHPnUnvqjp-bY-5ijN__buhV4HVaXUXc6HFZhwQ7X4NVfnIOu1J8TtTZvoesP4GKmIjp1xuMxnMrcjz4joS5qYVkTdR9u3bsmd49NJIcm6tX1qI5mbCbv4NtR7-LwCwmqCkS76TkhmUqNooq5y8YytdS6RZU0mqK0nzDupk1UnDPLE204E1xLVVWduGIyFm55Sd_D0nA0tB8gShgahTwWlc6Z4UJJRiulhDIdbmKZr8POrG9LHSjHUfniofShB-Xl_DOsw9a86njKs_Fcpdas98sw1ZryT9dv_PvxJrycJoRxr20Llib1T_sRXuhfk_umbsMiP_uKeHXThuWD3qA4c6VjThAPdh3240OPx4gJ1u2npx4LjxdtP_o8njsssu-_AYwy2Jg
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB58gXrwLb5dRMFLMI9NNyuIFB8ottVDFW9xX1GhtppUxT_lb3Q2TaqCePPgIYckS2Azk29mNjvfB7CpuKiYimSOClXoUBEZR2jKsFQRIUv8ULNci-CqxhqN6PqaXwzAe9kLY7dVlpiYA7XuKLtGvuMFGGlpgOF4__HJsapR9u9qKaHRc4sz8_aKJVu2d3qI9t3y_eOj5sGJU6gKOArds-uE0tcykBQP4wrfBAaTCqFVYKXtuMaLxpNuRA3zlGaUMyVkklTchAqXY3oV4HMHYZhiJWS_qLrf7CN_xIvWu9B3MK2gBZORZzmEsAhllr_te_z7Dv95TDue_G9vYwomiuyZVHvuPg0Dpj0D4184FfGs3ieizWahmjcY25UYco7g-FB0ne6SQ0sYbLW-jCbV1i3OrXv3kBHR1uQoTTspKdla5uDyT2Y0D0PtTtssAPGoBb3I5YmKqGZcChokUnKpK0y7IlqE7dKWsSoo1a2yRyvOS6uAxX2zL8JGf-hjj0fkp0ErpbXjAkqy-NPUS7_fXofRk2a9FtdOG2fLMNZb_Lb7ildgqJs-m1UYUS_d-yxdy72WwM1fO8YHtHAqdA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Multiuser+Optimization%3A+Distributed+Algorithms+and+Error+Analysis&rft.jtitle=SIAM+journal+on+optimization&rft.au=Koshal%2C+Jayash&rft.au=Nedi%C4%87%2C+Angelia&rft.au=Shanbhag%2C+Uday+V.&rft.date=2011-07-01&rft.issn=1052-6234&rft.eissn=1095-7189&rft.volume=21&rft.issue=3&rft.spage=1046&rft.epage=1081&rft_id=info:doi/10.1137%2F090770102&rft.externalDBID=n%2Fa&rft.externalDocID=10_1137_090770102
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1052-6234&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1052-6234&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1052-6234&client=summon