A rank preserving flow algorithm for quadratic optimization problems subject to quadratic equality constraints

This paper concerns quadratic programming problems subject to quadratic equality constraints such as arise in broadband antenna array signal processing and elsewhere. At first, such a problem is converted into a semidefinite programming problem with a rank constraint. Then, a rank preserving flow is...

Full description

Saved in:
Bibliographic Details
Published in1997 IEEE International Conference on Acoustics, Speech, and Signal Processing Vol. 1; pp. 67 - 70 vol.1
Main Authors Moore, J.B., Danchi Jiang
Format Conference Proceeding
LanguageEnglish
Published Washington DC IEEE 1997
IEEE Computer Society Press
Subjects
Antennas
Applied sciences
Costs
Exact sciences and technology
Information, signal and communications theory
Linear matrix inequalities
Mathematical methods
Matrix converters
Polynomials
Radiocommunications
Symmetric matrices
Telecommunications
Telecommunications and information theory
Vectors
Online AccessGet full text
ISBN0818679190
9780818679193
ISSN1520-6149
DOI10.1109/ICASSP.1997.599549

Cover

Abstract This paper concerns quadratic programming problems subject to quadratic equality constraints such as arise in broadband antenna array signal processing and elsewhere. At first, such a problem is converted into a semidefinite programming problem with a rank constraint. Then, a rank preserving flow is used to accommodate the rank constraint. The associated gradient formulas are carefully developed. The convergence of the resulting algorithm is also guaranteed. Our approach is demonstrated by a numerical experiment.
AbstractList This paper concerns quadratic programming problems subject to quadratic equality constraints such as arise in broadband antenna array signal processing and elsewhere. At first, such a problem is converted into a semidefinite programming problem with a rank constraint. Then, a rank preserving flow is used to accommodate the rank constraint. The associated gradient formulas are carefully developed. The convergence of the resulting algorithm is also guaranteed. Our approach is demonstrated by a numerical experiment.
Author Danchi Jiang
Moore, J.B.
Author_xml – sequence: 1
  givenname: J.B.
  surname: Moore
  fullname: Moore, J.B.
  organization: Dept. of Syst. Eng., Australian Nat. Univ., Canberra, ACT, Australia
– sequence: 2
  surname: Danchi Jiang
  fullname: Danchi Jiang
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2277979$$DView record in Pascal Francis
BookMark eNpNkE9LAzEQxQNWsNZ-gZ5y8NqaZDebnWMp_oOCQnsv2WxSU3eTNUmV-ukNVMS5zGPmNw_eXKOR804jNKNkQSmBu-fVcrN5XVAAseAAvIQLdE1qWlcCKJARGlPOyLyiJVyhaYwHkotzAaQaI7fEQbp3PAQddfi0bo9N57-w7PY-2PTWY-MD_jjKNshkFfZDsr39ztq7fOSbTvcRx2Nz0Crh5P-hOsvOphNW3sUUpHUp3qBLI7uop799grYP99vV03z98phzrOe2rGHOeNVyphpQnDBV8VbLtoVCKyGBSFIY3rA8qo0QtaoNq2QthYFWVVA0JWuKCbo92w4yKtmZHFHZuBuC7WU47RgTAgRkbHbGrNb6b3v-YfED6OJrdQ
ContentType Conference Proceeding
Copyright 1998 INIST-CNRS
Copyright_xml – notice: 1998 INIST-CNRS
DBID 6IE
6IL
CBEJK
RIE
RIL
IQODW
DOI 10.1109/ICASSP.1997.599549
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
Pascal-Francis
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Applied Sciences
EndPage 70 vol.1
ExternalDocumentID 2277979
599549
GroupedDBID 23M
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RNS
ACGHX
IQODW
RIB
RIC
ID FETCH-LOGICAL-i489-256d52cb9c502c65deadd93ec7a90a03f5b2ead8f778c8f26a8a7f9dc693b42b3
IEDL.DBID RIE
ISBN 0818679190
9780818679193
ISSN 1520-6149
IngestDate Wed Apr 02 07:25:17 EDT 2025
Tue Aug 26 18:05:11 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
License CC BY 4.0
LinkModel DirectLink
MeetingName ICASSP 97 : international conference on acoustics, speech, and signal processing (Munich, April 21-24, 1997. Volume I, Plenary, expert summaries, special, audio, underwater acoustics, VLSI)
MergedId FETCHMERGED-LOGICAL-i489-256d52cb9c502c65deadd93ec7a90a03f5b2ead8f778c8f26a8a7f9dc693b42b3
PageCount 4
ParticipantIDs ieee_primary_599549
pascalfrancis_primary_2277979
PublicationCentury 1900
PublicationDate 19970000
1997
PublicationDateYYYYMMDD 1997-01-01
PublicationDate_xml – year: 1997
  text: 19970000
PublicationDecade 1990
PublicationPlace Washington DC
PublicationPlace_xml – name: Washington DC
PublicationTitle 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing
PublicationTitleAbbrev ICASSP
PublicationYear 1997
Publisher IEEE
IEEE Computer Society Press
Publisher_xml – name: IEEE
– name: IEEE Computer Society Press
SSID ssj0000557906
ssj0008748
Score 1.3838687
Snippet This paper concerns quadratic programming problems subject to quadratic equality constraints such as arise in broadband antenna array signal processing and...
SourceID pascalfrancis
ieee
SourceType Index Database
Publisher
StartPage 67
SubjectTerms Antennas
Applied sciences
Costs
Exact sciences and technology
Information, signal and communications theory
Linear matrix inequalities
Mathematical methods
Matrix converters
Polynomials
Radiocommunications
Symmetric matrices
Telecommunications
Telecommunications and information theory
Vectors
Title A rank preserving flow algorithm for quadratic optimization problems subject to quadratic equality constraints
URI https://ieeexplore.ieee.org/document/599549
Volume 1
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NT8JAEN0oJ72oiBEVswevhdJud7tHQiRooiEBE25kv4pEaJW2Mfrr3WkLovHgrR_bNJ1OZqbTee8hdKO1b7MkEY71JeHY-pY7Ng1Hjla0KykoJQnodzw80uETuZ8G04pnu8DCGGOK4TPThs3iX75OVA6tsg6QYxG-j_ZZSEuo1radAlRSBXF5FYRDVghn2ewEX0eEF9SPQN7GbQasiHc2-_4GTOPyzl2_Nx6PAMPH2uXtKtkVGJoUqbVbVApe7GShwVEJ704L8kIYPnlp55lsq89f1I7_fMBj1PiG--HRNpGdoD0T19HhDlPhKYp7GNTdMYzNQnSJ5zhaJu9YLOfJepE9r7AtfvFbLjR4lMKJjUSrCuKJK9GaFKe5hLYPzpKdpabEdX5gBaUqKFZkaQNNBreT_tCppBqcBYExqYDqwFOSq8D1FA209U_NfaOY4K5w_SiQnj0URoyFKow8KqwLRNw6BPcl8aR_hmpxEptzhH2XiIAwylVXEsOJjEKhmCEkMNy3i5uoDnabvZZkHLPSZE3U-vF2tqc9jzHO-MWfV12ig5KNFjoqV6iWrXPTsjVGJq8L7_oChkbN4g
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV09T8MwELWgDMAClCK-8cCaNo3tOB4RArVQUKUWqVtlOw5UlASaRAh-Pb4kLQUxsOXDUZTzyXc533sPofMwJDZKUulYX5KOzW-FY8Nw5ITabysflJIk1Dvu7v3OA70ZsVHFs11gYYwxRfOZacJhsZcfJjqHUlkLyLGoWEVrjFLKSrDWoqACZFIFdXm1DAe8kM6y8Qn-j6goyB-Bvk3YGFhR78zPyRxO44pW9_JiMOgDio83yxdWwivQNilTa7molLxYikPXWyXAOy3oC6H95LmZZ6qpP3-RO_7zE7dR4xvwh_uLULaDVkxcR5tLXIW7KL7AoO-OoXEW1pf4EUfT5B3L6WMym2RPL9imv_gtlyH4lMaJXYteKpAnrmRrUpzmCgo_OEuWhpoS2fmBNSSroFmRpQ00vL4aXnacSqzBmVBolGJ-yDythGaup30WWg8NBTGaS-FKl0RMefZSEHEe6CDyfGmdIBLWJQRR1FNkD9XiJDb7CBOXSka5L3RbUSOoigKpubEzbgSxgw9QHew2fi3pOMalyQ7QyY_ZWdz2PM4FF4d_PnWG1jvDu964172_PUIbJTct1FeOUS2b5ebEZhyZOi087Qt3cNEv
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%3Abook&rft.genre=proceeding&rft.title=1997+IEEE+International+Conference+on+Acoustics%2C+Speech%2C+and+Signal+Processing&rft.atitle=A+rank+preserving+flow+algorithm+for+quadratic+optimization+problems+subject+to+quadratic+equality+constraints&rft.au=Moore%2C+J.B.&rft.au=Danchi+Jiang&rft.date=1997-01-01&rft.pub=IEEE&rft.isbn=9780818679193&rft.issn=1520-6149&rft.volume=1&rft.spage=67&rft.epage=70+vol.1&rft_id=info:doi/10.1109%2FICASSP.1997.599549&rft.externalDocID=599549
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1520-6149&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1520-6149&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1520-6149&client=summon