Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

A Finite Step Projective Algorithm for Solving Linear Matrix Inequalities

Simple item page
dc.contributor.authorOrsi, Robert
dc.contributor.authorRami, Mustapha
dc.contributor.authorMoore, John
dc.coverage.spatialMaui USA
dc.date.accessioned2015-12-13T23:09:43Z
dc.date.createdDecember 9 2003
dc.date.issued2003
dc.date.updated2015-12-12T08:20:26Z
dc.description.abstractThis paper presents an algorithm for finding feasible solutions of linear matrix inequalities. The algorithm is based on the method of alternating projections (MAP), a classical method for solving convex feasibility problems. Unlike MAP, which is an iterative method that converges asymptotically to a feasible point, the algorithm converges after a finite number of steps. The key computational component of the algorithm is an eigenvalue-eigenvector decomposition which is carried out at each iteration. Computational results for the algorithm are presented and comparisons are made with existing algorithms.
dc.identifier.isbn078037925X
dc.identifier.urihttp://hdl.handle.net/1885/87128
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE Inc)
dc.relation.ispartofseriesIEEE Conference on Decision and Control 2003
dc.sourceProceedings of the 42nd IEEE Conference on Decision and Control
dc.subjectKeywords: Algorithms; Constraint theory; Eigenvalues and eigenfunctions; Linear systems; Mathematical models; Matrix algebra; Problem solving; Vectors; Finite step projective algorithm; Linear matrix inequalities; Control system analysis
dc.titleA Finite Step Projective Algorithm for Solving Linear Matrix Inequalities
dc.typeConference paper
local.bibliographicCitation.lastpage4984
local.bibliographicCitation.startpage4979
local.contributor.affiliationOrsi, Robert, National ICT Australia
local.contributor.affiliationRami, Mustapha, University of Wurzburg
local.contributor.affiliationMoore, John, College of Engineering and Computer Science, ANU
local.contributor.authoruidMoore, John, u8202879
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor010203 - Calculus of Variations, Systems Theory and Control Theory
local.identifier.ariespublicationMigratedxPub16281
local.identifier.scopusID2-s2.0-1542289984
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Orsi_A_Finite_Step_Projective_2003.pdf
Size:
148.42 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS