Solution sets of three sparse optimization problems for multivariate regression

In multivariate regression analysis, a coefficient matrix is used to relate multiple response variables to regressor variables in a noisy linear system from given data. Optimization is a natural approach to find such coefficient matrix with few nonzero rows. However, the relationship of most group s...

Full description

Saved in:
Bibliographic Details
Published inJournal of global optimization Vol. 87; no. 2-4; pp. 347 - 371
Main Authors Chen, Xiaojun, Pan, Lili, Xiu, Naihua
Format Journal Article
LanguageEnglish
Published New York Springer US 01.11.2023
Springer
Subjects
Online AccessGet full text
ISSN0925-5001
1573-2916
DOI10.1007/s10898-021-01124-w

Cover

Abstract In multivariate regression analysis, a coefficient matrix is used to relate multiple response variables to regressor variables in a noisy linear system from given data. Optimization is a natural approach to find such coefficient matrix with few nonzero rows. However, the relationship of most group sparse optimization models with cardinality penalty or cardinality constraints is not clear. In this paper, we give a comprehensive description of the relationship between three widely used group sparse optimization problems with cardinality terms: (i) the number of nonzero rows is minimized subject to an error tolerance for regression; (ii) the error for regression is minimized subject to a row cardinality constraint; (iii) the sum of the number of nonzero rows and error for regression is minimized. The first two problems have convex constraints and cardinality constraints respectively, while the third one is an unconstrained optimization problem with a cardinality penalty. We provide sufficient conditions under which the three optimization problems have the same global minimizers. Moreover, we analyze the relationship of stationary points and local minimizers of the three problems. Finally, we use two examples to illustrate our theoretical results for finding solutions of constrained optimization problems involving cardinality terms by unconstrained optimization problems with penalty functions.
AbstractList In multivariate regression analysis, a coefficient matrix is used to relate multiple response variables to regressor variables in a noisy linear system from given data. Optimization is a natural approach to find such coefficient matrix with few nonzero rows. However, the relationship of most group sparse optimization models with cardinality penalty or cardinality constraints is not clear. In this paper, we give a comprehensive description of the relationship between three widely used group sparse optimization problems with cardinality terms: (i) the number of nonzero rows is minimized subject to an error tolerance for regression; (ii) the error for regression is minimized subject to a row cardinality constraint; (iii) the sum of the number of nonzero rows and error for regression is minimized. The first two problems have convex constraints and cardinality constraints respectively, while the third one is an unconstrained optimization problem with a cardinality penalty. We provide sufficient conditions under which the three optimization problems have the same global minimizers. Moreover, we analyze the relationship of stationary points and local minimizers of the three problems. Finally, we use two examples to illustrate our theoretical results for finding solutions of constrained optimization problems involving cardinality terms by unconstrained optimization problems with penalty functions.
Audience Academic
Author Chen, Xiaojun
Pan, Lili
Xiu, Naihua
Author_xml – sequence: 1
  givenname: Xiaojun
  surname: Chen
  fullname: Chen, Xiaojun
  email: maxjchen@polyu.edu.hk
  organization: Department of Applied Mathematics, The Hong Kong Polytechnic University
– sequence: 2
  givenname: Lili
  surname: Pan
  fullname: Pan, Lili
  organization: Department of Mathematics, Shandong University of Technology
– sequence: 3
  givenname: Naihua
  surname: Xiu
  fullname: Xiu, Naihua
  organization: Department of Applied Mathematics, Beijing Jiaotong University
BookMark eNp9kMtqwzAQRUVJoUnaH-jKP-B0JNuRvAyhLwh00XYtxoqUKtiWkZSG9uurxl11EWZxYbhnYM6MTHrXa0JuKSwoAL8LFEQtcmA0B0pZmR8vyJRWvMhZTZcTMoWaVXkFQK_ILIQ9ANSiYlPy8uraQ7Suz4KOIXMmix9e6ywM6IPO3BBtZ7_x1Bi8a1rdhcw4n3WHNtpP9BajzrzeeR1CKl2TS4Nt0Dd_OSfvD_dv66d88_L4vF5tclUUEHOKnKHBhilsRFlvq0oAVAgKDRPcKORLZIi0oohC6QLrkolGN1zVxRZKVszJYry7w1ZL2xsXPao0W91ZleQYm_YrzilwuizKBIgRUN6F4LWRysbTXwm0raQgf03K0aRMJuXJpDwmlP1DB2879F_noWKEQir3O-3l3h18n5yco34AimuLVw
CitedBy_id crossref_primary_10_1007_s10957_024_02381_x
crossref_primary_10_12677_ORF_2023_136734
crossref_primary_10_12677_ORF_2023_136745
crossref_primary_10_1287_moor_2023_0295
crossref_primary_10_1007_s10589_023_00465_4
crossref_primary_10_1016_j_neucom_2024_128267
crossref_primary_10_1007_s10915_024_02584_4
crossref_primary_10_1007_s11425_022_2289_0
crossref_primary_10_1080_10556788_2022_2142583
Cites_doi 10.1109/TIP.2012.2190081
10.1109/TSP.2006.881263
10.1287/moor.2015.0722
10.1137/19M1304799
10.1214/09-AOS776
10.1007/s11222-008-9111-x
10.1214/15-AOS1388
10.1109/TIM.2016.2615449
10.1016/j.sigpro.2005.05.030
10.1016/j.acha.2014.10.001
10.1016/j.sigpro.2005.05.031
10.1109/TIP.2012.2205006
10.1137/080714488
10.1137/S0097539792240406
10.1137/11085476X
10.1007/s11425-016-9010-x
10.1007/s10107-016-0986-6
10.1137/100808071
10.1137/120869778
10.1016/j.acha.2019.04.003
10.1088/1361-6420/33/2/025010
10.1016/j.acha.2015.10.010
10.1016/j.acha.2018.02.002
10.1109/TIT.2012.2189196
10.1137/15M1028054
10.1023/A:1014813701864
10.1007/s10208-013-9161-0
10.1007/s11590-012-0456-x
10.1016/j.acha.2015.03.001
10.1137/18M1186009
10.1109/TSP.2016.2630028
10.1016/j.acha.2016.10.001
10.1007/978-3-642-02431-3
10.1109/ICASSP.2012.6288698
10.1109/CVPR.2012.6247852
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022
COPYRIGHT 2023 Springer
Copyright_xml – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022
– notice: COPYRIGHT 2023 Springer
DBID AAYXX
CITATION
DOI 10.1007/s10898-021-01124-w
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
Sciences (General)
Computer Science
EISSN 1573-2916
EndPage 371
ExternalDocumentID A771071634
10_1007_s10898_021_01124_w
GroupedDBID -52
-57
-5G
-BR
-EM
-Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
2.D
203
28-
29K
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
3V.
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
78A
7WY
88I
8AO
8FE
8FG
8FL
8G5
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYOK
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTAH
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYQZM
AZFZN
AZQEC
B-.
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
COF
CS3
CSCUP
D-I
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EBLON
EBS
EDO
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GUQSH
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IAO
IHE
IJ-
IKXTQ
ITC
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K60
K6V
K6~
K7-
KDC
KOV
KOW
L6V
LAK
LLZTM
M0C
M0N
M2O
M2P
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9M
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SBE
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WK8
YLTOR
Z45
Z5O
Z7R
Z7X
Z7Z
Z81
Z83
Z86
Z88
Z8M
Z8N
Z8T
Z8U
Z8W
Z92
ZMTXR
ZWQNP
ZY4
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
AMVHM
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
PUEGO
ID FETCH-LOGICAL-c330t-1a72afab2cab849d558005a0caf287fca76a2aa151aa8ce3a9428beb7c93d0423
IEDL.DBID U2A
ISSN 0925-5001
IngestDate Mon Oct 20 17:00:40 EDT 2025
Wed Oct 01 01:34:46 EDT 2025
Thu Apr 24 22:58:29 EDT 2025
Fri Feb 21 02:44:09 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2-4
Keywords Sparse optimization
65F50
Local minimizer
90C46
Row selection problem
Stationary point
Multivariate regression
90C26
Global minimizer
90C27
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c330t-1a72afab2cab849d558005a0caf287fca76a2aa151aa8ce3a9428beb7c93d0423
PageCount 25
ParticipantIDs gale_infotracacademiconefile_A771071634
crossref_citationtrail_10_1007_s10898_021_01124_w
crossref_primary_10_1007_s10898_021_01124_w
springer_journals_10_1007_s10898_021_01124_w
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 20231100
2023-11-00
20231101
PublicationDateYYYYMMDD 2023-11-01
PublicationDate_xml – month: 11
  year: 2023
  text: 20231100
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationSubtitle An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering
PublicationTitle Journal of global optimization
PublicationTitleAbbrev J Glob Optim
PublicationYear 2023
Publisher Springer US
Springer
Publisher_xml – name: Springer US
– name: Springer
References Nikolova (CR24) 2016; 41
Esser, Moller, Osher, Sapiro, Xin (CR12) 2012; 21
Pan, Chen (CR28) 2021; 14
Natarajan (CR21) 1995; 24
CR11
CR33
Le (CR17) 2013; 7
Jiao, Jin, Lu (CR15) 2017; 65
Červinka, Kanzow, Schwartz (CR16) 2016; 160
Rockafellar, Wets (CR29) 1998
van den Berg, Friedlander (CR6) 2008; 31
Muduli, Mukherjee (CR20) 2017; 66
Satpathi, Chakraborty (CR31) 2017; 43
Tropp (CR34) 2006; 86
Obozinski, Taskar, Jordan (CR25) 2010; 20
Bauschke, Luke, Phan, Wang (CR1) 2014; 14
Yuan, Liu, Yan (CR37) 2012; 21
Chen, Huo (CR10) 2006; 54
Wen, Zhou, Liu, Lai, Tang (CR36) 2019; 47
Gillis (CR13) 2017; 25
Nikolova (CR23) 2013; 6
Beck, Eldar (CR2) 2013; 23
Beck, Hallak (CR3) 2015; 41
Blanchard, Leedy, Wu (CR8) 2020; 48
Lee, Bresler, Junge (CR18) 2012; 58
Bertsimas, King, Mazumder (CR5) 2016; 44
CR22
Lu, Zhang (CR19) 2013; 23
Zhang, Li (CR38) 2017; 33
Pan, Xiu, Fan (CR27) 2017; 60
Tropp, Gilbert, Strauss (CR35) 2006; 86
Bian, Chen (CR7) 2020; 58
Obozinski, Wainwright, Jordan (CR26) 2011; 39
Chen, Lu, Pong (CR9) 2016; 26
Jiao, Jin, Lu (CR14) 2015; 39
Belousov, Klatte (CR4) 2002; 22
Rockafellar (CR30) 2015
Shen, Xu, Zheng (CR32) 2016; 41
X Yuan (1124_CR37) 2012; 21
A Beck (1124_CR2) 2013; 23
M Nikolova (1124_CR23) 2013; 6
HH Bauschke (1124_CR1) 2014; 14
D Bertsimas (1124_CR5) 2016; 44
W Bian (1124_CR7) 2020; 58
JA Tropp (1124_CR34) 2006; 86
RT Rockafellar (1124_CR29) 1998
N Gillis (1124_CR13) 2017; 25
A Beck (1124_CR3) 2015; 41
1124_CR11
1124_CR33
Y Jiao (1124_CR14) 2015; 39
RT Rockafellar (1124_CR30) 2015
L Pan (1124_CR28) 2021; 14
J Chen (1124_CR10) 2006; 54
K Lee (1124_CR18) 2012; 58
G Obozinski (1124_CR26) 2011; 39
PR Muduli (1124_CR20) 2017; 66
M Červinka (1124_CR16) 2016; 160
JA Tropp (1124_CR35) 2006; 86
M Nikolova (1124_CR24) 2016; 41
L Pan (1124_CR27) 2017; 60
S Satpathi (1124_CR31) 2017; 43
E van den Berg (1124_CR6) 2008; 31
Z Lu (1124_CR19) 2013; 23
Y Jiao (1124_CR15) 2017; 65
1124_CR22
J Wen (1124_CR36) 2019; 47
B Natarajan (1124_CR21) 1995; 24
JD Blanchard (1124_CR8) 2020; 48
N Zhang (1124_CR38) 2017; 33
G Obozinski (1124_CR25) 2010; 20
HY Le (1124_CR17) 2013; 7
EG Belousov (1124_CR4) 2002; 22
E Esser (1124_CR12) 2012; 21
L Shen (1124_CR32) 2016; 41
X Chen (1124_CR9) 2016; 26
References_xml – ident: CR22
– volume: 21
  start-page: 3239
  year: 2012
  end-page: 3252
  ident: CR12
  article-title: A convex model for nonnegative matrix factorization and dimensionality reduction on physical space
  publication-title: IEEE Trans. Image Process.
  doi: 10.1109/TIP.2012.2190081
– volume: 54
  start-page: 4634
  year: 2006
  end-page: 4643
  ident: CR10
  article-title: Theoretical results on sparse representations of multiple-measurement vectors
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/TSP.2006.881263
– volume: 41
  start-page: 196
  year: 2015
  end-page: 223
  ident: CR3
  article-title: On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.2015.0722
– volume: 14
  start-page: 1
  year: 2021
  end-page: 25
  ident: CR28
  article-title: Group sparse optimization for image recovery using capped folded convace functions
  publication-title: SIAM J. Imaging Sci.
  doi: 10.1137/19M1304799
– volume: 39
  start-page: 1
  year: 2011
  end-page: 47
  ident: CR26
  article-title: Support union recovery in high-dimensional multivariate regression
  publication-title: Ann. Stat.
  doi: 10.1214/09-AOS776
– volume: 20
  start-page: 231
  year: 2010
  end-page: 252
  ident: CR25
  article-title: Joint covariate selection and joint subspace selection for multiple classification problems
  publication-title: Stat. Comput.
  doi: 10.1007/s11222-008-9111-x
– volume: 44
  start-page: 813
  year: 2016
  end-page: 852
  ident: CR5
  article-title: Best subset selection via a modern optimization lens
  publication-title: Ann. Stat.
  doi: 10.1214/15-AOS1388
– volume: 66
  start-page: 234
  year: 2017
  end-page: 242
  ident: CR20
  article-title: A subspace projection-based joint sparse recovery method for structured biomedical signals
  publication-title: IEEE Trans. Instrum. Measur.
  doi: 10.1109/TIM.2016.2615449
– volume: 86
  start-page: 572
  issue: 3
  year: 2006
  end-page: 588
  ident: CR35
  article-title: Algorithms for simultaneous sparse approximation. Part I: greedy pursuit
  publication-title: Signal Process.
  doi: 10.1016/j.sigpro.2005.05.030
– ident: CR33
– volume: 25
  start-page: 7
  year: 2017
  end-page: 16
  ident: CR13
  article-title: Introduction to nonnegative matrix factorization
  publication-title: SIAG-OPT Views News
– volume: 39
  start-page: 400
  year: 2015
  end-page: 426
  ident: CR14
  article-title: A primal dual active set with continuation algorithm for the -regularized optimization problem
  publication-title: Appl. Comput. Harmon. Anal.
  doi: 10.1016/j.acha.2014.10.001
– volume: 86
  start-page: 589
  year: 2006
  end-page: 602
  ident: CR34
  article-title: Algorithms for simultaneous sparse approximation, Part II: convex relaxation
  publication-title: Signal Process.
  doi: 10.1016/j.sigpro.2005.05.031
– volume: 21
  start-page: 4349
  year: 2012
  end-page: 4360
  ident: CR37
  article-title: Visual classification with multitask joint sparse representation
  publication-title: IEEE Trans. Image Process.
  doi: 10.1109/TIP.2012.2205006
– volume: 31
  start-page: 890
  year: 2008
  end-page: 912
  ident: CR6
  article-title: Probing the Pareto frontier for basis pursuit solutions
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/080714488
– volume: 24
  start-page: 227
  year: 1995
  end-page: 234
  ident: CR21
  article-title: Sparse approximate solutions to linear systems
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539792240406
– volume: 6
  start-page: 904
  year: 2013
  end-page: 937
  ident: CR23
  article-title: Description of the minimizers of least squares regularized with -norm: uniqueness of the global minimizer
  publication-title: SIAM J. Imaging Sci.
  doi: 10.1137/11085476X
– volume: 60
  start-page: 759
  year: 2017
  end-page: 776
  ident: CR27
  article-title: Optimality conditions for sparse nonlinear programming
  publication-title: Sci. China Math.
  doi: 10.1007/s11425-016-9010-x
– volume: 160
  start-page: 353
  year: 2016
  end-page: 377
  ident: CR16
  article-title: Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
  publication-title: Math. Program.
  doi: 10.1007/s10107-016-0986-6
– volume: 23
  start-page: 2448
  year: 2013
  end-page: 2478
  ident: CR19
  article-title: Sparse approximation via penalty decomposition methods
  publication-title: SIAM J. Optim.
  doi: 10.1137/100808071
– volume: 23
  start-page: 1480
  year: 2013
  end-page: 1509
  ident: CR2
  article-title: Sparsity constrained nonlinear optimization: optimality conditions and algorithms
  publication-title: SIAM J. Optim.
  doi: 10.1137/120869778
– volume: 48
  start-page: 482
  year: 2020
  end-page: 495
  ident: CR8
  article-title: On rank awareness, thresholding, and MUSIC for joint sparse recovery
  publication-title: Appl. Comput. Harmon. Anal.
  doi: 10.1016/j.acha.2019.04.003
– volume: 33
  start-page: 025010
  year: 2017
  ident: CR38
  article-title: On optimal solutions of the constrained regularization and its penalty problem
  publication-title: Inverse Probl.
  doi: 10.1088/1361-6420/33/2/025010
– volume: 41
  start-page: 237
  year: 2016
  end-page: 265
  ident: CR24
  article-title: Relationship between the optimal solutions of least squares regularized with -norm and constrained by -sparsity
  publication-title: Appl. Comput. Harmon. Anal.
  doi: 10.1016/j.acha.2015.10.010
– volume: 47
  start-page: 948
  year: 2019
  end-page: 974
  ident: CR36
  article-title: Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
  publication-title: Appl. Comput. Harmon. Anal.
  doi: 10.1016/j.acha.2018.02.002
– volume: 58
  start-page: 3613
  year: 2012
  end-page: 3641
  ident: CR18
  article-title: Subspace methods for joint sparse recovery
  publication-title: IEEE Trans. Inform. Theory.
  doi: 10.1109/TIT.2012.2189196
– volume: 26
  start-page: 1465
  year: 2016
  end-page: 1492
  ident: CR9
  article-title: Penalty methods for a class of non-Lipschitz optimization problems
  publication-title: SIAM J. Optim.
  doi: 10.1137/15M1028054
– volume: 22
  start-page: 37
  year: 2002
  end-page: 48
  ident: CR4
  article-title: A Frank-Wolfe type theorem for convex polynomial programs
  publication-title: Comput. Optim. Appl.
  doi: 10.1023/A:1014813701864
– year: 2015
  ident: CR30
  publication-title: Convex Analysis
– volume: 14
  start-page: 63
  year: 2014
  end-page: 83
  ident: CR1
  article-title: Restricted normal cones and sparsity optimization with affine constraints
  publication-title: Found. Comput. Math.
  doi: 10.1007/s10208-013-9161-0
– volume: 7
  start-page: 731
  year: 2013
  end-page: 743
  ident: CR17
  article-title: Generalized subdifferentials of the rank function
  publication-title: Optim. Lett.
  doi: 10.1007/s11590-012-0456-x
– ident: CR11
– volume: 41
  start-page: 26
  year: 2016
  end-page: 53
  ident: CR32
  article-title: Wavelet inpainting with the sparse regularization
  publication-title: Appl. Comput. Harmon. Anal.
  doi: 10.1016/j.acha.2015.03.001
– volume: 58
  start-page: 858
  year: 2020
  end-page: 883
  ident: CR7
  article-title: A smoothing proximal gradient algorithm for nonsmooth convex regression with cardinality penalty
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/18M1186009
– volume: 65
  start-page: 998
  year: 2017
  end-page: 1012
  ident: CR15
  article-title: Group sparse recovery via the penalty: theory and algorithm
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/TSP.2016.2630028
– volume: 43
  start-page: 568
  year: 2017
  end-page: 576
  ident: CR31
  article-title: On the number of iterations for convergence of CoSaMP and Subspace Pursuit algorithms
  publication-title: Appl. Comput. Harmon. Anal.
  doi: 10.1016/j.acha.2016.10.001
– year: 1998
  ident: CR29
  publication-title: Variational Analysis
  doi: 10.1007/978-3-642-02431-3
– volume: 44
  start-page: 813
  year: 2016
  ident: 1124_CR5
  publication-title: Ann. Stat.
  doi: 10.1214/15-AOS1388
– volume: 58
  start-page: 3613
  year: 2012
  ident: 1124_CR18
  publication-title: IEEE Trans. Inform. Theory.
  doi: 10.1109/TIT.2012.2189196
– volume: 23
  start-page: 1480
  year: 2013
  ident: 1124_CR2
  publication-title: SIAM J. Optim.
  doi: 10.1137/120869778
– volume-title: Variational Analysis
  year: 1998
  ident: 1124_CR29
  doi: 10.1007/978-3-642-02431-3
– volume: 7
  start-page: 731
  year: 2013
  ident: 1124_CR17
  publication-title: Optim. Lett.
  doi: 10.1007/s11590-012-0456-x
– volume: 66
  start-page: 234
  year: 2017
  ident: 1124_CR20
  publication-title: IEEE Trans. Instrum. Measur.
  doi: 10.1109/TIM.2016.2615449
– volume: 21
  start-page: 4349
  year: 2012
  ident: 1124_CR37
  publication-title: IEEE Trans. Image Process.
  doi: 10.1109/TIP.2012.2205006
– ident: 1124_CR33
  doi: 10.1109/ICASSP.2012.6288698
– volume: 43
  start-page: 568
  year: 2017
  ident: 1124_CR31
  publication-title: Appl. Comput. Harmon. Anal.
  doi: 10.1016/j.acha.2016.10.001
– volume: 48
  start-page: 482
  year: 2020
  ident: 1124_CR8
  publication-title: Appl. Comput. Harmon. Anal.
  doi: 10.1016/j.acha.2019.04.003
– ident: 1124_CR11
  doi: 10.1109/CVPR.2012.6247852
– volume: 41
  start-page: 237
  year: 2016
  ident: 1124_CR24
  publication-title: Appl. Comput. Harmon. Anal.
  doi: 10.1016/j.acha.2015.10.010
– volume: 14
  start-page: 1
  year: 2021
  ident: 1124_CR28
  publication-title: SIAM J. Imaging Sci.
  doi: 10.1137/19M1304799
– volume: 31
  start-page: 890
  year: 2008
  ident: 1124_CR6
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/080714488
– volume: 54
  start-page: 4634
  year: 2006
  ident: 1124_CR10
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/TSP.2006.881263
– volume: 21
  start-page: 3239
  year: 2012
  ident: 1124_CR12
  publication-title: IEEE Trans. Image Process.
  doi: 10.1109/TIP.2012.2190081
– volume: 14
  start-page: 63
  year: 2014
  ident: 1124_CR1
  publication-title: Found. Comput. Math.
  doi: 10.1007/s10208-013-9161-0
– volume: 65
  start-page: 998
  year: 2017
  ident: 1124_CR15
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/TSP.2016.2630028
– volume: 24
  start-page: 227
  year: 1995
  ident: 1124_CR21
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539792240406
– volume: 33
  start-page: 025010
  year: 2017
  ident: 1124_CR38
  publication-title: Inverse Probl.
  doi: 10.1088/1361-6420/33/2/025010
– ident: 1124_CR22
– volume: 6
  start-page: 904
  year: 2013
  ident: 1124_CR23
  publication-title: SIAM J. Imaging Sci.
  doi: 10.1137/11085476X
– volume: 26
  start-page: 1465
  year: 2016
  ident: 1124_CR9
  publication-title: SIAM J. Optim.
  doi: 10.1137/15M1028054
– volume: 60
  start-page: 759
  year: 2017
  ident: 1124_CR27
  publication-title: Sci. China Math.
  doi: 10.1007/s11425-016-9010-x
– volume: 160
  start-page: 353
  year: 2016
  ident: 1124_CR16
  publication-title: Math. Program.
  doi: 10.1007/s10107-016-0986-6
– volume: 41
  start-page: 196
  year: 2015
  ident: 1124_CR3
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.2015.0722
– volume: 47
  start-page: 948
  year: 2019
  ident: 1124_CR36
  publication-title: Appl. Comput. Harmon. Anal.
  doi: 10.1016/j.acha.2018.02.002
– volume: 25
  start-page: 7
  year: 2017
  ident: 1124_CR13
  publication-title: SIAG-OPT Views News
– volume: 86
  start-page: 589
  year: 2006
  ident: 1124_CR34
  publication-title: Signal Process.
  doi: 10.1016/j.sigpro.2005.05.031
– volume: 20
  start-page: 231
  year: 2010
  ident: 1124_CR25
  publication-title: Stat. Comput.
  doi: 10.1007/s11222-008-9111-x
– volume: 41
  start-page: 26
  year: 2016
  ident: 1124_CR32
  publication-title: Appl. Comput. Harmon. Anal.
  doi: 10.1016/j.acha.2015.03.001
– volume: 22
  start-page: 37
  year: 2002
  ident: 1124_CR4
  publication-title: Comput. Optim. Appl.
  doi: 10.1023/A:1014813701864
– volume: 23
  start-page: 2448
  year: 2013
  ident: 1124_CR19
  publication-title: SIAM J. Optim.
  doi: 10.1137/100808071
– volume-title: Convex Analysis
  year: 2015
  ident: 1124_CR30
– volume: 39
  start-page: 1
  year: 2011
  ident: 1124_CR26
  publication-title: Ann. Stat.
  doi: 10.1214/09-AOS776
– volume: 58
  start-page: 858
  year: 2020
  ident: 1124_CR7
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/18M1186009
– volume: 39
  start-page: 400
  year: 2015
  ident: 1124_CR14
  publication-title: Appl. Comput. Harmon. Anal.
  doi: 10.1016/j.acha.2014.10.001
– volume: 86
  start-page: 572
  issue: 3
  year: 2006
  ident: 1124_CR35
  publication-title: Signal Process.
  doi: 10.1016/j.sigpro.2005.05.030
SSID ssj0009852
Score 2.4213006
Snippet In multivariate regression analysis, a coefficient matrix is used to relate multiple response variables to regressor variables in a noisy linear system from...
SourceID gale
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 347
SubjectTerms Computer Science
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Real Functions
Title Solution sets of three sparse optimization problems for multivariate regression
URI https://link.springer.com/article/10.1007/s10898-021-01124-w
Volume 87
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVEBS
  databaseName: EBSCOhost Mathematics Source - HOST
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20241101
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: AMVHM
  dateStart: 20080329
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/mathematics-source
  providerName: EBSCOhost
– providerCode: PRVLSH
  databaseName: SpringerLink Journals
  customDbUrl:
  mediaType: online
  eissn: 1573-2916
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: AFBBN
  dateStart: 19910301
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 1573-2916
  dateEnd: 20241101
  omitProxy: true
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Technology Collection
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20241101
  omitProxy: true
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: 8FG
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/technologycollection1
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK - Czech Republic Consortium
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: AGYKE
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://link.springer.com
  providerName: Springer Nature
– providerCode: PRVAVX
  databaseName: SpringerLink Journals (ICM)
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: U2A
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://www.springerlink.com/journals/
  providerName: Springer Nature
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fS8MwED788aIP6qbi_DHyIKhooEubNX0cog5l-uJkPpVLmvqim6xV_30vXaoORPCpFNJQesndd8193wEcBl2FWRIZTsE44hTxFVcEBLgQeUC5WyxkxeMe3Hb7w-h6JEeeFFbU1e71kWTlqX-Q3ZSjgwmX_lJU4h-LsCydnBet4qHofUvtqqrPTpAIySV5YU-V-X2OuXBUO-X5I9Eq0lxuwJqHiKw3s2kDFuy4Cet1-wXmd2MTVn9oCdLd4EuAtWhCw48q2LEXlj7ZhLv6HxgrbFmwSc5KsqRl5FSmhWUT8h4vnpbJfKOZghGoZVXV4Ttl1QRM2dQ-zWpnx1swvLy4P-9z31CBmzAMSt7BWGCOWhjUKkoyKQkuSgwM5pQ45QbjLgpEAgGIytgQE0pOtNWxScLMFdBsw9J4MrY7wAKVSdTYsVrpSKNQGBPUzKMg07SjRd6CTv1dU-PVxl3Ti-f0WyfZ2SIlW6SVLdKPFpx-PfM609r4c_SRM1fqNiLNbNDzCej9nKRV2osJPFE2GEYtOKstmvodWvwx8e7_hu_BimtBP-Mn7sNSOX2zBwRUSt2G5d7V482Fuw4e-oN2tU4_AfZh4kU
linkProvider Springer Nature
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB61y4Fy6MJSxJaXD0gUtUZZJ9k4xxWCLo-lF1aiJ2vsOD0UdqtN6Er8esaJw0sIiWMkx3L8mPkmnu8bgN2gLzFLI8PJGUecPL7kkoAAFyIPKHZLRFzxuEcX_eE4Or2KrzwprGiy3ZsrycpSPyG7SUcHEy78Ja_E5x9hIaIARbRgYfDz99nRo9iurCrtBKmIeUx22JNlXu_lmUNqzPLzS9HK1xy3YdyMsk4x-XtwW-oDc_dCwPG9n7EMnz34ZIN6t6zABzvpQLsp7MD8Oe_A0hOVQnoaPUi7Fh1Y8a0K9s1LVu-vwq_m7xorbFmwac5K2iOWkbmaFZZNyS7deMIn8yVsCkZwmVX5jP8pXifIy2b2T52VO_kC4-Ojy8Mh96UauAnDoOQ9TATmqIVBLaM0i2MCojEGBnMKyXKDSR8FIsELRGlsiCmFPdrqxKRh5lJz1qA1mU7sOrBAZjFq7FktdaRRSEwIxOZRkGmyFSLvQq9ZL2W8jrkrp3GtHhWY3RQrmmJVTbGad-H7wzv_ahWPN1vvuW2g3BGnng16pgKNz4llqUFCsIzizDDqwo9mkZU_-8UbHX99X_MdWBxejs7V-cnF2QZ8coXuaxbkJrTK2a3dIjhU6m2_--8B2F__NQ
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fa9swED62DEr3sK1pS7Ofeii0pRVxZDuWH8O20K1N2ocG-iZOsryX1Qmxt_z7O9lykkIp7NEgC-PT3X1n3_cdwHEwlJilkeGUjCNOGV9ySUCAC5EHVLslIq553JPp8HIW_byP77dY_HW3e_tLsuE0OJWmouovsry_RXyTjhomXClMGYqvXsKryAkl0ImeidFGdlfWM3eCVMQ8pojsaTNP7_EoNbUB-vHv0TrrjN_BGw8X2aix7x68sEUX3rajGJj3zC683tIVpKvJWoy17MKeX1WyUy8yfbYPN-33MFbaqmTznFVkVcsowCxLy-YUSR48RZP5oTMlI4DL6g7Ev1RhE0hlS_ur6aMtDmA2_n739ZL74QrchGFQ8QEmAnPUwqCWUZrFMUHHGAODORVRucFkiAKRAAGiNDbElAoVbXVi0jBzzTSH0CnmhT0CFsgsRo0Dq6WONAqJCcHOPAoyTd4t8h4M2veqjFcedwMwfquNZrKzhSJbqNoWatWD8_U9i0Z349nVJ85cyjkl7WzQcwvo-Zy8lRolBKSoMgyjHly0FlXeW8tnNn7_f8u_wM7tt7G6_jG9-gC7bjJ9Q1v8CJ1q-cd-IvxS6c_1Ef0HlAvmPQ
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=Solution+sets+of+three+sparse+optimization+problems+for+multivariate+regression&rft.jtitle=Journal+of+global+optimization&rft.au=Chen%2C+Xiaojun&rft.au=Pan%2C+Lili&rft.au=Xiu%2C+Naihua&rft.date=2023-11-01&rft.issn=0925-5001&rft.eissn=1573-2916&rft.volume=87&rft.issue=2-4&rft.spage=347&rft.epage=371&rft_id=info:doi/10.1007%2Fs10898-021-01124-w&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10898_021_01124_w
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5001&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5001&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5001&client=summon