A gradient descent based algorithm for ℓ minimization

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 283; no. 1; pp. 47 - 56
Main Authors Jiang, Shan, Fang, Shu-Cherng, Nie, Tiantian, Xing, Wenxun
Format Journal Article
LanguageEnglish
Published 01.05.2020
Online AccessGet full text
ISSN0377-2217
DOI10.1016/j.ejor.2019.11.051

Cover

Author Jiang, Shan
Fang, Shu-Cherng
Xing, Wenxun
Nie, Tiantian
Author_xml – sequence: 1
  givenname: Shan
  surname: Jiang
  fullname: Jiang, Shan
– sequence: 2
  givenname: Shu-Cherng
  surname: Fang
  fullname: Fang, Shu-Cherng
– sequence: 3
  givenname: Tiantian
  surname: Nie
  fullname: Nie, Tiantian
– sequence: 4
  givenname: Wenxun
  surname: Xing
  fullname: Xing, Wenxun
BookMark eNp9jztOw0AURacIEklgA1TegM1744xnXEYRPykSDdSj-TyHsfxBM26gZgfskJUQQyoKqlOdq3tWbDGMAzF2hVAgYHXdFtSOseCAdYFYgMAFW0IpZc45ynO2SqkFABQolkxus0M0PtAwZZ6Sm2lNIp-Z7jDGML30WTPG7OvjM-vDEPrwbqYwDhfsrDFdossT1-z59uZpd5_vH-8edtt97jjClG8cCakqSUZZlFZwZa2w0hE4r4wRXlS1B0tUqxoq9IToROlLtK42G0XlmqnfXRfHlCI12oXp58EUTeg0gp6jdavnaD1Ha0R9jD6q_I_6GkNv4tt_0jen7WIH
CitedBy_id crossref_primary_10_1002_nav_22251
crossref_primary_10_1109_ACCESS_2020_3045163
crossref_primary_10_3934_jimo_2021211
crossref_primary_10_1142_S0219691321500041
Cites_doi 10.1007/s10107-015-0939-5
10.1007/s10107-016-1107-2
10.1137/090775397
10.1137/110840364
10.1007/s10589-013-9553-8
10.1002/cpa.20132
10.1088/1742-5468/2009/09/L09003
10.1137/070692285
10.1137/080714488
10.1016/j.procs.2010.04.272
10.1007/s00041-008-9045-x
10.1016/j.jfranklin.2015.03.039
10.1007/s10107-012-0613-0
10.1007/s10107-014-0753-5
10.1109/TIT.2006.871582
10.1007/s10107-011-0470-2
10.1137/090761471
10.1007/s12532-013-0063-6
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1016/j.ejor.2019.11.051
DatabaseName CrossRef
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EndPage 56
ExternalDocumentID 10_1016_j_ejor_2019_11_051
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1OL
1RT
1~.
1~5
29G
4.4
41~
457
4G.
5GY
5VS
6OB
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AATTM
AAXKI
AAXUO
AAYFN
AAYWO
AAYXX
ABAOU
ABBOA
ABFNM
ABFRF
ABJNI
ABMAC
ABUCO
ABWVN
ABXDB
ACDAQ
ACGFO
ACGFS
ACIWK
ACLOT
ACNCT
ACNNM
ACRLP
ACRPL
ACVFH
ACZNC
ADBBV
ADCNI
ADEZE
ADGUI
ADIYS
ADJOM
ADMUD
ADNMO
ADXHL
AEBSH
AEFWE
AEIPS
AEKER
AENEX
AEUPX
AFFNX
AFJKZ
AFPUW
AFTJW
AGHFR
AGQPQ
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGII
AIGVJ
AIIUN
AIKHN
AITUG
AKBMS
AKRWK
AKYEP
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
AOUOD
APLSM
APXCP
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CITATION
CS3
DU5
EBS
EFJIC
EFKBS
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
ROL
RPZ
RXW
SCC
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
VH1
WUQ
XPP
ZMT
~02
~G-
~HD
ID FETCH-LOGICAL-c210t-4ce57867ea8b17b528bb5b7ce0cd8aa5d569d0bee989061de11c53d31bc9a48e3
ISSN 0377-2217
IngestDate Thu Oct 09 00:40:40 EDT 2025
Thu Apr 24 23:02:35 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c210t-4ce57867ea8b17b528bb5b7ce0cd8aa5d569d0bee989061de11c53d31bc9a48e3
PageCount 10
ParticipantIDs crossref_citationtrail_10_1016_j_ejor_2019_11_051
crossref_primary_10_1016_j_ejor_2019_11_051
PublicationCentury 2000
PublicationDate 20200501
PublicationDateYYYYMMDD 2020-05-01
PublicationDate_xml – month: 05
  year: 2020
  text: 20200501
  day: 01
PublicationDecade 2020
PublicationTitle European journal of operational research
PublicationYear 2020
References Chen (10.1016/j.ejor.2019.11.051_bib0007) 2010; 32
Donoho (10.1016/j.ejor.2019.11.051_bib0010) 2006; 59
Kabashima (10.1016/j.ejor.2019.11.051_bib0015) 2009; 2009
van den Berg (10.1016/j.ejor.2019.11.051_bib0001) 2009; 31
van den Berg (10.1016/j.ejor.2019.11.051_bib0002) 2007
Mairal (10.1016/j.ejor.2019.11.051_bib0020) 2008
Ge (10.1016/j.ejor.2019.11.051_bib0013) 2011; 129
Liu (10.1016/j.ejor.2019.11.051_bib0018) 2016; 158
Nie (10.1016/j.ejor.2019.11.051_bib0021) 2012
Chen (10.1016/j.ejor.2019.11.051_bib0006) 2014; 143
Donoho (10.1016/j.ejor.2019.11.051_bib0009) 2006; 52
Ma (10.1016/j.ejor.2019.11.051_bib0019) 2015; 352
Bian (10.1016/j.ejor.2019.11.051_bib0003) 2015; 149
Fountoulakis (10.1016/j.ejor.2019.11.051_bib0011) 2014; 6
Ge (10.1016/j.ejor.2019.11.051_bib0012) 2017; 166
Chen (10.1016/j.ejor.2019.11.051_bib0008) 2014; 59
Haeser (10.1016/j.ejor.2019.11.051_bib0014) 2018
Lai (10.1016/j.ejor.2019.11.051_bib0016) 2011; 21
Chen (10.1016/j.ejor.2019.11.051_sbref0005) 2010; 1
Lai (10.1016/j.ejor.2019.11.051_bib0017) 2013; 51
Candès (10.1016/j.ejor.2019.11.051_bib0004) 2008; 14
Nikolova (10.1016/j.ejor.2019.11.051_bib0022) 2008; 1
References_xml – volume: 158
  start-page: 467
  issue: 1
  year: 2016
  ident: 10.1016/j.ejor.2019.11.051_bib0018
  article-title: A smoothing SQP framework for a class of composite Lq minimization over polyhedron
  publication-title: Mathematical Programming
  doi: 10.1007/s10107-015-0939-5
– volume: 166
  start-page: 131
  issue: 1
  year: 2017
  ident: 10.1016/j.ejor.2019.11.051_bib0012
  article-title: An improved algorithm for the l2-lp minimization problem
  publication-title: Mathematical Programming
  doi: 10.1007/s10107-016-1107-2
– volume: 21
  start-page: 82
  issue: 1
  year: 2011
  ident: 10.1016/j.ejor.2019.11.051_bib0016
  article-title: An unconstrained ℓq minimization with 0 < q < 1 for sparse solution of underdetermined linear systems
  publication-title: SIAM Journal on Optimization
  doi: 10.1137/090775397
– volume: 51
  start-page: 927
  issue: 2
  year: 2013
  ident: 10.1016/j.ejor.2019.11.051_bib0017
  article-title: Improved iteratively reweighted least squares for unconstrained smoothed ℓq minimization
  publication-title: SIAM Journal on Numerical Analysis
  doi: 10.1137/110840364
– volume: 59
  start-page: 47
  issue: 1
  year: 2014
  ident: 10.1016/j.ejor.2019.11.051_bib0008
  article-title: Convergence of the reweighted ℓ1 minimization algorithm for ℓ2−ℓ1 minimization
  publication-title: Computational Optimization and Applications
  doi: 10.1007/s10589-013-9553-8
– volume: 59
  start-page: 797
  issue: 6
  year: 2006
  ident: 10.1016/j.ejor.2019.11.051_bib0010
  article-title: For most large underdetermined systems of linear equations the minimal ℓ1-norm solution is also the sparsest solution.
  publication-title: Communications on Pure and Applied Mathematics
  doi: 10.1002/cpa.20132
– year: 2018
  ident: 10.1016/j.ejor.2019.11.051_bib0014
  article-title: Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
  publication-title: Mathematical Programming, online first
– volume: 2009
  start-page: L09003
  issue: 09
  year: 2009
  ident: 10.1016/j.ejor.2019.11.051_bib0015
  article-title: A typical reconstruction limit for compressed sensing based on Lp-norm minimization
  publication-title: Journal of Statistical Mechanics: Theory and Experiment
  doi: 10.1088/1742-5468/2009/09/L09003
– volume: 1
  start-page: 2
  issue: 1
  year: 2008
  ident: 10.1016/j.ejor.2019.11.051_bib0022
  article-title: Efficient reconstruction of piecewise constant images using nonsmooth nonconvex minimization
  publication-title: SIAM Journal on Imaging Sciences
  doi: 10.1137/070692285
– volume: 31
  start-page: 890
  issue: 2
  year: 2009
  ident: 10.1016/j.ejor.2019.11.051_bib0001
  article-title: Probing the pareto frontier for basis pursuit solutions
  publication-title: SIAM Journal on Scientific Computing
  doi: 10.1137/080714488
– year: 2007
  ident: 10.1016/j.ejor.2019.11.051_bib0002
  article-title: Sparco: A testing framework for sparse reconstruction
– start-page: 566
  year: 2012
  ident: 10.1016/j.ejor.2019.11.051_bib0021
  article-title: Robust matrix completion via joint schatten p-norm and ℓp-norm minimization
– start-page: 1
  year: 2008
  ident: 10.1016/j.ejor.2019.11.051_bib0020
  article-title: Discriminative learned dictionaries for local image analysis
– volume: 1
  start-page: 2417
  issue: 1
  year: 2010
  ident: 10.1016/j.ejor.2019.11.051_sbref0005
  article-title: Lp-norm proximal support vector machine and its applications
  publication-title: Procedia Computer Science
  doi: 10.1016/j.procs.2010.04.272
– volume: 14
  start-page: 877
  issue: 5
  year: 2008
  ident: 10.1016/j.ejor.2019.11.051_bib0004
  article-title: Enhancing sparsity by reweighted ℓ1 minimization
  publication-title: Journal of Fourier Analysis and Applications
  doi: 10.1007/s00041-008-9045-x
– volume: 352
  start-page: 2708
  issue: 7
  year: 2015
  ident: 10.1016/j.ejor.2019.11.051_bib0019
  article-title: Maximum correntropy criterion based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian environments
  publication-title: Journal of the Franklin Institute
  doi: 10.1016/j.jfranklin.2015.03.039
– volume: 143
  start-page: 371
  issue: 1
  year: 2014
  ident: 10.1016/j.ejor.2019.11.051_bib0006
  article-title: Complexity of unconstrained L2-Lp minimization
  publication-title: Mathematical Programming
  doi: 10.1007/s10107-012-0613-0
– volume: 149
  start-page: 301
  issue: 1
  year: 2015
  ident: 10.1016/j.ejor.2019.11.051_bib0003
  article-title: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
  publication-title: Mathematical Programming
  doi: 10.1007/s10107-014-0753-5
– volume: 52
  start-page: 1289
  issue: 4
  year: 2006
  ident: 10.1016/j.ejor.2019.11.051_bib0009
  article-title: Compressed sensing
  publication-title: IEEE Transactions on Information Theory
  doi: 10.1109/TIT.2006.871582
– volume: 129
  start-page: 285
  issue: 2
  year: 2011
  ident: 10.1016/j.ejor.2019.11.051_bib0013
  article-title: A note on the complexity of Lp minimization
  publication-title: Mathematical Programming
  doi: 10.1007/s10107-011-0470-2
– volume: 32
  start-page: 2832
  issue: 5
  year: 2010
  ident: 10.1016/j.ejor.2019.11.051_bib0007
  article-title: Lower bound theory of nonzero entries in solutions of ℓ2−ℓp minimization
  publication-title: SIAM Journal on Scientific Computing
  doi: 10.1137/090761471
– volume: 6
  start-page: 1
  issue: 1
  year: 2014
  ident: 10.1016/j.ejor.2019.11.051_bib0011
  article-title: Matrix-free interior point method for compressed sensing problems
  publication-title: Mathematical Programming Computation
  doi: 10.1007/s12532-013-0063-6
SSID ssj0001515
Score 2.3543453
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 47
Title A gradient descent based algorithm for ℓ minimization
Volume 283
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier)
  issn: 0377-2217
  databaseCode: GBLVA
  dateStart: 20110101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0001515
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Science Direct
  issn: 0377-2217
  databaseCode: .~1
  dateStart: 19950101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0001515
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect (Elsevier)
  issn: 0377-2217
  databaseCode: ACRLP
  dateStart: 19950105
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0001515
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect (Elsevier)
  issn: 0377-2217
  databaseCode: AIKHN
  dateStart: 19950105
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0001515
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  issn: 0377-2217
  databaseCode: AKRWK
  dateStart: 19770101
  customDbUrl:
  isFulltext: true
  mediaType: online
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001515
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NT9wwELUQlSp6oHShKhQqH-AUZRUnceIcV4jVCqk9gdhbFH8EWEG2WmUlxIET_4B_yC_pOLaTQAuCXqKVlVi7Oy_j8XjeG4T2IaignIapL5I08GNBhc8ZUz4vOOM6QOdSE5x__komp_HxlE67E92GXVLzobj9J6_kf6wKY2BXzZJ9h2XbSWEAPoN94QoWhuubbDzyzhdNyVbtSSPL5OlVSXrF1fkcdv0X100VYVPQEB9kkaeFRK4t8_LFnLyNT2Fg4TKFVhKoTR0fX7o080WHrnE7tvQPAQp2TWwOPYy2LzxV9-A4tf1UzlR1s6z6-Ycw6Kr9HO8qTf0wNAxM51ND053mCXiMhzT6mnatNZrif3lxk1CYDdVsriVbSTbUQqtWmPaJZPazpawtMHS1a7Ncz5HrOWCvkweabP8hhAVAd_kY3nXVQDquaw6c7I-x_CpTCvj8e_RimF4wcrKB1u0uAo8MJL6gFVUN0EdHYhigz65ZB7a-e4A-9ZQnN1E6wg462EIHN9DBLXQwQAc_3j_gPmi20On46ORw4tseGr6AzXwNb58Cn5ykqmCcpPBWMs4pT4UKhGRFQSVNMhlwpTKWQWgnFSGCRjIiXGRFzFT0Fa1W80p9QzguS6JoEsUCQhpawnxclZxIVpJYRhHZRsT9K7mwAvO6z8lV_rI1tpHXPvPbyKu8cvfOu-7-jtY6vO6i1XqxVHsQQdb8R2P7Pxf5cVo
linkProvider Elsevier
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=A+gradient+descent+based+algorithm+for+%E2%84%93+minimization&rft.jtitle=European+journal+of+operational+research&rft.au=Jiang%2C+Shan&rft.au=Fang%2C+Shu-Cherng&rft.au=Nie%2C+Tiantian&rft.au=Xing%2C+Wenxun&rft.date=2020-05-01&rft.issn=0377-2217&rft.volume=283&rft.issue=1&rft.spage=47&rft.epage=56&rft_id=info:doi/10.1016%2Fj.ejor.2019.11.051&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2019_11_051
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon