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.

Distributed algorithm for achieving finite-time minimum l1 norm solutions of linear equation

Thumbnail Image

Date

2018

Authors

Zhou, Jingqiu
Xuan, Wang
Mou, Shaoshuai
Anderson, Brian

Journal Title

Journal ISSN

Volume Title

Publisher

IEEE

Abstract

Abstract— This paper proposes a distributed algorithm for multi-agent networks to achieve a minimum l1-norm solution to a linear equation Ax = b where A has full row rank. When the underlying network is undirected and fixed, it is proved that the proposed algorithm drive all agents’ individual states to converge in finite-time to the same minimum l1-norm solution. Numerical simulations are also provided as validation of the proposed algorithms.

Description

Keywords

Citation

URI

http://hdl.handle.net/1885/203579

Collections

ANU Research Publications

Source

Proceedings of 2018 American Control Conference (ACC)

Type

Conference paper

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

2037-12-31

Downloads

File
Description
01_Zhou_Distributed_algorithm_for_2018.pdf (442.19 KB)

DSpace software copyright © 2002-2026 LYRASIS