Computational issues in alternating projection algorithms for                 fixed-order control design.

Eric Bengt Beran; K. Grigoriadis

doi:10.1109/ACC.1997.611759

Computational issues in alternating projection algorithms for fixed-order control design.

Eric Bengt Beran, K. Grigoriadis

University of Houston

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

728 Downloads (Pure)

Abstract

Alternating projection algorithms have been introduced recently to solve fixed-order controller design problems described by linear matrix inequalities and non-convex coupling rank constraints. In this work, an extensive numerical experimentation using proposed benchmark fixed-order control design examples is used to indicate the computational efficiency of the method. These results indicate that the proposed alternating projections are effective in obtaining low-order controllers for small and medium order problems

Original language	English
Title of host publication	Proc. American Control Conference, Albuquerque, New Mexico
Publisher	IEEE
Publication date	1997
Pages	81-85
ISBN (Print)	0-7803-3832-4
DOIs	https://doi.org/10.1109/ACC.1997.611759
Publication status	Published - 1997
Event	1997 American Control Conference - Albuquerque, NM, United States Duration: 4 Jun 1997 → 6 Jun 1997 http://www.ece.unm.edu/controls/ACC97/welcome.html

Conference

Conference	1997 American Control Conference
Country/Territory	United States
City	Albuquerque, NM
Period	04/06/1997 → 06/06/1997
Internet address	http://www.ece.unm.edu/controls/ACC97/welcome.html

Bibliographical note

Copyright: 1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Access to Document

10.1109/ACC.1997.611759

BeranFinal published version, 459 KB

OpenUrl availability

Full text

Cite this

@inproceedings{c881e100505248818b4186622dbba690,

title = "Computational issues in alternating projection algorithms for fixed-order control design.",

abstract = "Alternating projection algorithms have been introduced recently to solve fixed-order controller design problems described by linear matrix inequalities and non-convex coupling rank constraints. In this work, an extensive numerical experimentation using proposed benchmark fixed-order control design examples is used to indicate the computational efficiency of the method. These results indicate that the proposed alternating projections are effective in obtaining low-order controllers for small and medium order problems",

author = "Beran, {Eric Bengt} and K. Grigoriadis",

note = "Copyright: 1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE; 1997 American Control Conference, ACC 97 ; Conference date: 04-06-1997 Through 06-06-1997",

year = "1997",

doi = "10.1109/ACC.1997.611759",

language = "English",

isbn = "0-7803-3832-4",

pages = "81--85",

booktitle = "Proc. American Control Conference, Albuquerque, New Mexico",

publisher = "IEEE",

address = "United States",

url = "http://www.ece.unm.edu/controls/ACC97/welcome.html",

}

TY - GEN

T1 - Computational issues in alternating projection algorithms for fixed-order control design.

AU - Beran, Eric Bengt

AU - Grigoriadis, K.

N1 - Copyright: 1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

PY - 1997

Y1 - 1997

N2 - Alternating projection algorithms have been introduced recently to solve fixed-order controller design problems described by linear matrix inequalities and non-convex coupling rank constraints. In this work, an extensive numerical experimentation using proposed benchmark fixed-order control design examples is used to indicate the computational efficiency of the method. These results indicate that the proposed alternating projections are effective in obtaining low-order controllers for small and medium order problems

AB - Alternating projection algorithms have been introduced recently to solve fixed-order controller design problems described by linear matrix inequalities and non-convex coupling rank constraints. In this work, an extensive numerical experimentation using proposed benchmark fixed-order control design examples is used to indicate the computational efficiency of the method. These results indicate that the proposed alternating projections are effective in obtaining low-order controllers for small and medium order problems

U2 - 10.1109/ACC.1997.611759

DO - 10.1109/ACC.1997.611759

M3 - Article in proceedings

SN - 0-7803-3832-4

SP - 81

EP - 85

BT - Proc. American Control Conference, Albuquerque, New Mexico

PB - IEEE

T2 - 1997 American Control Conference

Y2 - 4 June 1997 through 6 June 1997

ER -