Convex optimization problems involving finite autocorrelation sequences

We discuss convex optimization problems in which some of the variables are constrained to be finite autocorrelation sequences. Problems of this form arise in signal processing and communications, and we describe applications in filter design and system identification. Autocorrelation constraints in...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical programming Jg. 93; H. 3; S. 331 - 359
Hauptverfasser: Alkire, Brien, Vandenberghe, Lieven
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Heidelberg Springer 01.12.2002
Springer Nature B.V
Schlagworte:
ISSN:0025-5610, 1436-4646
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We discuss convex optimization problems in which some of the variables are constrained to be finite autocorrelation sequences. Problems of this form arise in signal processing and communications, and we describe applications in filter design and system identification. Autocorrelation constraints in optimization problems are often approximated by sampling the corresponding power spectral density, which results in a set of linear inequalities. They can also be cast as linear matrix inequalities via the Kalman-Yakubovich-Popov lemma. The linear matrix inequality formulation is exact, and results in convex optimization problems that can be solved using interior-point methods for semidefinite programming. However, it has an important drawback: to represent an autocorrelation sequence of length $n$, it requires the introduction of a large number ($n(n+1)/2$) of auxiliary variables. This results in a high computational cost when general-purpose semidefinite programming solvers are used. We present a more efficient implementation based on duality and on interior-point methods for convex problems with generalized linear inequalities.
AbstractList We discuss convex optimization problems in which some of the variables are constrained to be finite autocorrelation sequences. Problems of this form arise in signal processing and communications, and we describe applications in filter design and system identification. Autocorrelation constraints in optimization problems are often approximated by sampling the corresponding power spectral density, which results in a set of linear inequalities. They can also be cast as linear matrix inequalities via the Kalman-Yakubovich-Popov lemma. The linear matrix inequality formulation is exact, and results in convex optimization problems that can be solved using interior-point methods for semidefinite programming. However, it has an important drawback: to represent an autocorrelation sequence of length $n$, it requires the introduction of a large number ($n(n+1)/2$) of auxiliary variables. This results in a high computational cost when general-purpose semidefinite programming solvers are used. We present a more efficient implementation based on duality and on interior-point methods for convex problems with generalized linear inequalities.
Author Vandenberghe, Lieven
Alkire, Brien
Author_xml – sequence: 1
  givenname: Brien
  surname: Alkire
  fullname: Alkire, Brien
– sequence: 2
  givenname: Lieven
  surname: Vandenberghe
  fullname: Vandenberghe, Lieven
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=14491240$$DView record in Pascal Francis
BookMark eNp1kE1LAzEQhoNUsK3-AG-L4HF1ZpPddI9StAoFL72HbEwkZZvUJC3VX2_qFg-CpznM-zHzTMjIeacJuUa4QwB-HxEQeAlQlUApKw9nZIyMNiVrWDMi47yoy7pBuCCTGNcAgHQ2G5PF3Lu9PhR-m-zGfslkvSu2wXe93sTCur3v99a9F8Y6m3Qhd8krH4LuB2XUHzvtlI6X5NzIPuqr05yS1dPjav5cLl8XL_OHZakoQCqN5m-N4lhpo7imVHIOumGtqVjd1dJ0LdOoGuxaZfJsTauYkazm2BiqgE7JzRCbT8zNMYm13wWXG0VFq1mNWNEsuj2JZFSyN0E6ZaPYBruR4VMgYy1W7BjGB50KPsagjVA2_fyVgrS9QBBHtmJgKzJCcWQrDtmJf5y_4f96vgEvIn-3
CODEN MHPGA4
CitedBy_id crossref_primary_10_1109_TSP_2006_872556
crossref_primary_10_1109_TSP_2006_880218
crossref_primary_10_1109_TAC_2009_2014922
crossref_primary_10_1109_JLT_2007_891457
crossref_primary_10_1109_LSP_2015_2419571
crossref_primary_10_1109_MSP_2010_936020
crossref_primary_10_1137_17M1160124
crossref_primary_10_1016_j_ijepes_2011_06_003
crossref_primary_10_1109_JSTSP_2014_2370953
crossref_primary_10_1155_ASP_2006_42961
crossref_primary_10_3166_ejc_12_3_29
crossref_primary_10_1137_040612646
crossref_primary_10_1109_TAC_2003_814103
crossref_primary_10_1109_TSP_2007_896285
crossref_primary_10_3166_ejc_9_307_321
crossref_primary_10_1007_s10107_021_01663_w
crossref_primary_10_1109_LSP_2016_2555880
crossref_primary_10_1109_TSP_2008_924134
crossref_primary_10_1007_s11075_007_9076_4
crossref_primary_10_1109_TSP_2007_897903
crossref_primary_10_1016_j_ijepes_2007_12_003
crossref_primary_10_1016_j_sigpro_2024_109506
crossref_primary_10_1631_FITEE_1601726
crossref_primary_10_1016_j_automatica_2007_06_026
crossref_primary_10_1109_JSTSP_2007_910261
crossref_primary_10_1109_MSP_2010_936040
crossref_primary_10_1049_iet_gtd_20070516
crossref_primary_10_1016_j_ejor_2004_12_025
crossref_primary_10_1137_S0895479803374840
crossref_primary_10_1016_j_sigpro_2008_01_010
crossref_primary_10_1016_S0005_1098_03_00129_8
crossref_primary_10_1109_TSP_2018_2862399
crossref_primary_10_1002_nla_546
crossref_primary_10_1109_78_960409
crossref_primary_10_1109_TGRS_2024_3358863
crossref_primary_10_1109_JSTSP_2007_909369
crossref_primary_10_1109_TSP_2008_2009021
crossref_primary_10_1109_TVT_2013_2265339
crossref_primary_10_1109_TAC_2002_806652
crossref_primary_10_1109_TSP_2004_823497
crossref_primary_10_1080_00207179_2013_833366
crossref_primary_10_1016_j_sigpro_2019_06_023
crossref_primary_10_1109_TSP_2016_2601291
crossref_primary_10_1137_050623796
crossref_primary_10_1016_j_sigpro_2017_07_024
crossref_primary_10_1109_LSP_2007_913609
crossref_primary_10_1109_TCSI_2002_808218
crossref_primary_10_1109_TSP_2009_2032449
crossref_primary_10_1007_s10957_024_02581_5
ContentType Journal Article
Copyright 2003 INIST-CNRS
Copyright Springer-Verlag 2002
Copyright_xml – notice: 2003 INIST-CNRS
– notice: Copyright Springer-Verlag 2002
DBID AAYXX
CITATION
IQODW
3V.
7SC
7WY
7WZ
7XB
87Z
88I
8AL
8AO
8FD
8FE
8FG
8FK
8FL
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
HCIFZ
JQ2
K60
K6~
K7-
L.-
L.0
L6V
L7M
L~C
L~D
M0C
M0N
M2P
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1007/s10107-002-0334-x
DatabaseName CrossRef
Pascal-Francis
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Science Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
Technology collection
ProQuest One Community College
ProQuest Central
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
ABI/INFORM Professional Standard
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global
Computing Database
Science Database
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace 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
ProQuest Central Basic
DatabaseTitle CrossRef
ProQuest Business Collection (Alumni Edition)
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest One Applied & Life Sciences
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ABI/INFORM Professional Standard
ProQuest Central Korea
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList ProQuest Business Collection (Alumni Edition)
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
Applied Sciences
EISSN 1436-4646
EndPage 359
ExternalDocumentID 702959751
14491240
10_1007_s10107_002_0334_x
GroupedDBID --Z
-Y2
-~C
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1OL
1SB
203
29M
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5VS
67Z
6NX
6TJ
78A
7WY
88I
8AO
8FE
8FG
8FL
8TC
8UJ
8VB
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDBF
ABDZT
ABECU
ABFSG
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACNCT
ACOKC
ACOMO
ACPIV
ACSTC
ACUHS
ACZOJ
ADHHG
ADHIR
ADHKG
ADIMF
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADXHL
ADYFF
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMOZ
AEMSY
AENEX
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFFHD
AFGCZ
AFHIU
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHQJS
AHSBF
AHWEU
AHYZX
AIAKS
AIGIU
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMVHM
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
AZQEC
B-.
B0M
BA0
BAPOH
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CCPQU
CITATION
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EAD
EAP
EBA
EBLON
EBR
EBS
EBU
ECS
EDO
EIOEI
EJD
EMI
EMK
EPL
ESBYG
EST
ESX
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ7
GQ8
GXS
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
H~9
I-F
I09
IAO
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K1G
K60
K6V
K6~
K7-
KDC
KOV
L6V
LAS
LLZTM
M0C
M2P
M4Y
M7S
MA-
N2Q
N9A
NB0
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
P19
P2P
P62
P9R
PF0
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
QWB
R89
R9I
RHV
RNS
ROL
RPX
RSV
S16
S27
S3B
SAP
SDD
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TH9
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WH7
WK8
XPP
YLTOR
Z45
ZL0
ZMTXR
~02
~8M
~EX
--K
1B1
28-
5QI
AAYZH
AEFIE
AESKC
AFEXP
AFFNX
AFOHR
AGGDS
AIIXL
BBWZM
CAG
COF
H13
IQODW
KOW
NDZJH
NQ-
R4E
RIG
RNI
RPZ
RZK
S1Z
S26
S28
SCLPG
T16
ZWQNP
3V.
7SC
7XB
8AL
8FD
8FK
JQ2
L.-
L.0
L7M
L~C
L~D
M0N
PKEHL
PQEST
PQUKI
PRINS
PUEGO
Q9U
ID FETCH-LOGICAL-c300t-fe7d6c712efc7e33a770e649f245b5afb94e1c61b9cf1c69f9c4fa45716f3c03
IEDL.DBID M2P
ISICitedReferencesCount 77
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000180847900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0025-5610
IngestDate Thu Sep 25 00:47:23 EDT 2025
Mon Jul 21 09:16:01 EDT 2025
Tue Nov 18 22:34:14 EST 2025
Sat Nov 29 05:48:50 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Autocorrelation function
Filter
Kalman filter
Linear matrix inequality
Interior point method
Signal processing
Semi definite programming
System identification
Sampling
Convex programming
Constrained optimization
Mathematical programming
Language English
License http://www.springer.com/tdm
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c300t-fe7d6c712efc7e33a770e649f245b5afb94e1c61b9cf1c69f9c4fa45716f3c03
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
PQID 232851123
PQPubID 25307
PageCount 29
ParticipantIDs proquest_journals_232851123
pascalfrancis_primary_14491240
crossref_citationtrail_10_1007_s10107_002_0334_x
crossref_primary_10_1007_s10107_002_0334_x
PublicationCentury 2000
PublicationDate 2002-12-01
PublicationDateYYYYMMDD 2002-12-01
PublicationDate_xml – month: 12
  year: 2002
  text: 2002-12-01
  day: 01
PublicationDecade 2000
PublicationPlace Heidelberg
PublicationPlace_xml – name: Heidelberg
PublicationTitle Mathematical programming
PublicationYear 2002
Publisher Springer
Springer Nature B.V
Publisher_xml – name: Springer
– name: Springer Nature B.V
SSID ssj0001388
Score 1.9977429
Snippet We discuss convex optimization problems in which some of the variables are constrained to be finite autocorrelation sequences. Problems of this form arise in...
SourceID proquest
pascalfrancis
crossref
SourceType Aggregation Database
Index Database
Enrichment Source
StartPage 331
SubjectTerms Algorithms
Applied sciences
Convex analysis
Digital Object Identifier
Exact sciences and technology
Fourier transforms
Mathematical programming
Methods
Operational research and scientific management
Operational research. Management science
Optimization
Semidefinite programming
Signal processing
System theory
Variables
Title Convex optimization problems involving finite autocorrelation sequences
URI https://www.proquest.com/docview/232851123
Volume 93
WOSCitedRecordID wos000180847900001&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: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: 7WY
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: M0C
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: P5Z
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: K7-
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: M7S
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: BENPR
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: M2P
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1da9swFL20yR42yrpPlqY1fthTQUyy5Mh6Km3oB5SE0Jau24uxZQkCW5LVzsjP75UtuyuFvgzDNcIWGF356kg6ugfgqxQ0Y3nBSSEsTlCYzklusojkCU9EXOAV21psQk6nyd2dmnluTulplW1MrAN1sdRujfwbjvw1OOBHqz_EiUa5zVWvoLENfQQ2zDG6JtGsC8SMJ0mr2OpgQrup2ZycY26NztFvORdk82RY2lllJbaQbaQtnkXpeug52_3Pj34Hbz3mDI-bTvIetsziA7z5JxMhliZd-tbyI5yPHRd9Ey4xnvz2BzVDLz1ThvMFhjS3DhHauUOsYbaultqpfDS8urCjZ3-Cm7PTm_EF8YoLRHNKK2KNLEZasshYLQ3nmZTUjISykYjzOLO5EobpEcuVtnhXVmlhMxHjpMtyTfln6C2WC_MFwswWRaGSOqGd4FLmlmqESghYjI4iFQ2Atu2dap-N3Ili_Eof8yg7F6XootS5KN0M4LCrsmpScbz0cvDEiY81hFCIaegAhq3LUv_blmnnr70Xnw7hdSsKQ9k-9Kr7tTmAV_pvNS_vA9iW338E0D85nc6usHQpCdoJHQd193RWXqOdxT_RXl3fPgD8kex4
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LSsQwFL2MD1AR3-L4zEI3QjFN0kmzEBGfw-jgYhbuQpsmMKAzox11_Cc_0qQvHQR3LqSLUvqANqf3niQ35wDsc4YjP06olzBjOyi-ir1YR8SLQxqyILFbYDKzCd5uh_f34q4GH-VaGFdWWcbELFAnfeXGyI9s5s_IAT0ZPHnONMpNrpYOGjkqWvr9zfbY0uPmuW3eA0IuLzpn115hKuApivHQM5onDcV9oo3imtKIc6wbTBjCgjiITCyY9lXDj4Uydi-MUMxELLD9CkMVpvaxEzDFnK6YKxQkd1Xc92kYlgaxjpWUc6j5Qj3fDQm6al9KmTcay4Lzgyi1DWJyJ40fSSHLdJeL_-sbLcFCwajRaf4LLENN91Zg7pvOoj26rcRp01W4OnOV9iPUt9HysViGigpjnRR1ezZgu1EWZLqOj6PoZdhXzsMkrxpEVfH5GnT-4rXWYbLX7-kNQJFJkkSEmVwfo5zHBitLBC0d04oQQeqAy-aVqtBad5YfD_JLJdohQlpESIcIOarDYXXLIBca-e3i3THMfN3BmLCMDddhq0SILIJSKit4bP56dg9mrju3N_Km2W5twWxpf4P9bZgcPr_oHZhWr8Nu-ryb4R-B_GMsfQJFtkLs
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=Convex+optimization+problems+involving+finite+autocorrelation+sequences&rft.jtitle=Mathematical+programming&rft.au=Alkire%2C+Brien&rft.au=Vandenberghe%2C+Lieven&rft.date=2002-12-01&rft.pub=Springer+Nature+B.V&rft.issn=0025-5610&rft.eissn=1436-4646&rft.volume=93&rft.issue=3&rft.spage=331&rft_id=info:doi/10.1007%2Fs10107-002-0334-x&rft.externalDocID=702959751
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0025-5610&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0025-5610&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0025-5610&client=summon