Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities

Saved in:
Bibliographic Details
Published inSIAM journal on optimization
Format Journal Article
LanguageEnglish
Online AccessGet full text
ISSN1095-7189
1052-6234
DOI10.1137/18m1166511

Cover

BookMark eNpFkE1Lw0AYhPdQD7V68RfsXaJ5N1-7Rwl-QbFC9RzeTTbtC8nukmxt019vRMHTDDMwMM8lW1hnDWM3EN8BJMU9yB4gzzOABVtCrLKoAKmWbFe63nfmRGHiruXvOATCrpv41ngcUHeGl85-mdMczWYMA5I1Dd_4QD2dMZCz_Ehhz9-cjdbkx3pP4Uxo-Zbs7tDhQIHMeMUuWuxGc_2nK_b59PhRvkTrzfNr-bCOapEXIdI6rpWSgAhFCy2ITOeQCGWkFI3SjVY6w7RpIE3EXBSpkGkmdK3qJC9EK5MVu_3dPViP03G-UvmBehymCuLqB0X1jyL5Bnr8WHc
CitedBy_id crossref_primary_10_1007_s10898_022_01151_1
crossref_primary_10_1007_s10957_024_02381_x
crossref_primary_10_1093_imanum_drac005
crossref_primary_10_1080_10556788_2020_1818082
crossref_primary_10_1137_19M1259432
crossref_primary_10_1007_s10915_022_01897_6
crossref_primary_10_1137_19M1286025
crossref_primary_10_1137_23M1546701
crossref_primary_10_1137_19M1255355
ContentType Journal Article
DBID ADTOC
UNPAY
DOI 10.1137/18m1166511
DatabaseName Unpaywall for CDI: Periodical Content
Unpaywall
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
ExternalDocumentID oai:ira.lib.polyu.edu.hk:10397/91236
GroupedDBID -~X
.4S
.DC
123
4.4
7RQ
7WY
7X2
7XC
88I
8CJ
8FE
8FG
8FH
8FL
8G5
8V8
AALVN
AASXH
ABDBF
ABDPE
ABJCF
ABKAD
ABMZU
ABUWG
ACGFO
ACGOD
ACIWK
ACPRK
ACUHS
ADBBV
ADTOC
AEMOZ
AENEX
AFFNX
AFKRA
AFRAH
AHQJS
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ANXRF
ARAPS
ARCSS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
BPHCQ
CCPQU
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
UNPAY
YNT
ID FETCH-LOGICAL-c267t-bb0c9981aa17f1f125b61329e882d9bdb9b5a4dd14326137428452bc9c3672f83
IEDL.DBID UNPAY
ISSN 1095-7189
1052-6234
IngestDate Sun Oct 26 04:13:38 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c267t-bb0c9981aa17f1f125b61329e882d9bdb9b5a4dd14326137428452bc9c3672f83
OpenAccessLink https://proxy.k.utb.cz/login?url=http://ira.lib.polyu.edu.hk/bitstream/10397/91236/1/18m1166511.pdf
ParticipantIDs unpaywall_primary_10_1137_18m1166511
PublicationTitle SIAM journal on optimization
Score 2.3320274
SourceID unpaywall
SourceType Open Access Repository
Title Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
URI http://ira.lib.polyu.edu.hk/bitstream/10397/91236/1/18m1166511.pdf
UnpaywallVersion submittedVersion
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8JAEN4oHAwH30aNmj1wXcq229eREAkxgiRIgifSabdKKG0DJVp-vbNtVRIvJh56aLePTTuZ_aYz3zeEND3HDHGIM0d4kgkwgblSAAMunQAHjXbRM3IwtPoT8TA1pxUXRlFhVqVEUppEeUm8fVtoMM8UccJbaipvaWuuUgzRuMadJeeWhZChlQbhPqlbJuLxGqlPhqPOS5HmNHWG63uRWkYswdARu5VGKTfsnRs0yMEmTr383YuinfWld0T8L5ZOWVayaG0yaPnb36KN_5j6MTms4CftlPZyQvZkfEoaO6KEuDf4VnJdn5FX5TCUaGaW0ySkI2VpOPucjqVSDYdI0q4qXP_AQ6r5Z9FyQgb0CV3RsuJ4UvWzlw6TmD3O07VKXGzRKOkYH6eKYAtN13My6d0_d_usas7AfN2yMwbQ9jFU457H7ZCHiJPAUk3rJUL2wIUAXDA9EQSIxzBIMzACd4Spg-_6hmXroWNckFqcxPKSUB6qy4SwcRO63gaMcRCohm2whVLIuyLN748zS0sRjlkRvBj27OdNXv_ttBtSy1YbeYtYIoO7ylg-AaY5xy4
linkProvider Unpaywall
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8JAEN4oHAwH30aNmj1wXcq229eREAkxgiRIgifSabdKKG0DJVp-vbNtVRIvJh56aLePTTuZ_aYz3zeEND3HDHGIM0d4kgkwgblSAAMunQAHjXbRM3IwtPoT8TA1pxUXRlFhVqVEUppEeUm8fVtoMM8UccJbaipvaWuuUgzRuMadJeeWhZChlQbhPqlbJuLxGqlPhqPOS5HmNHWG63uRWkYswdARu5VGKTfsnRs0yMEmTr383YuinfWld0T8L5ZOWVayaG0yaPnb36KN_5j6MTms4CftlPZyQvZkfEoaO6KEuDf4VnJdn5FX5TCUaGaW0ySkI2VpOPucjqVSDYdI0q4qXP_AQ6r5Z9FyQgb0CV3RsuJ4UvWzlw6TmD3O07VKXGzRKOkYH6eKYAtN13My6d0_d_usas7AfN2yMwbQ9jFU457H7ZCHiJPAUk3rJUL2wIUAXDA9EQSIxzBIMzACd4Spg-_6hmXroWNckFqcxPKSUB6qy4SwcRO63gaMcRCohm2whVLIuyLN748zS0sRjlkRvBj27OdNXv_ttBtSy1YbeYtYIoO7ylg-AaY5xy4
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=Complexity+of+Partially+Separable+Convexly+Constrained+Optimization+with+Non-Lipschitzian+Singularities&rft.jtitle=SIAM+journal+on+optimization&rft.issn=1095-7189&rft_id=info:doi/10.1137%2F18m1166511&rft.externalDocID=oai%3Aira.lib.polyu.edu.hk%3A10397%2F91236
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1095-7189&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1095-7189&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1095-7189&client=summon