Skip navigation
Skip navigation

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]

CollectionsANU Research Publications
Date published: 2003
Type: Conference paper
URI: http://hdl.handle.net/1885/87128
Source: Proceedings of the 42nd IEEE Conference on Decision and Control

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:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator