Skip navigation
Skip navigation
Open Research will be down for maintenance between 8:00 and 8:15 am on Tuesday, December 1 2020.

A Finite Step Projective Algorithm for Solving Linear Matrix Inequalities

Orsi, Robert; Rami, Mustapha; Moore, John

Description

This 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...[Show more]

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.identifier.isbn078037925X
dc.identifier.urihttp://hdl.handle.net/1885/87128
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.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.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2003
local.identifier.absfor010203 - Calculus of Variations, Systems Theory and Control Theory
local.identifier.ariespublicationMigratedxPub16281
local.type.statusPublished Version
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.description.embargo2037-12-31
local.bibliographicCitation.startpage4979
local.bibliographicCitation.lastpage4984
dc.date.updated2015-12-12T08:20:26Z
local.identifier.scopusID2-s2.0-1542289984
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Orsi_A_Finite_Step_Projective_2003.pdf148.42 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator