Solving the Matrix Nearness Problem in the Maximum Norm by Applying a Projection and Contraction Method

M. H. Xu and H. Shao

Advances in Operations Research, 2012, vol. 2012, 1-15

Abstract:

Let S be a closed convex set of matrices and C be a given matrix. The matrix nearness problem considered in this paper is to find a matrix X in the set S at which max { | ð ‘¥ ð ‘– ð ‘— − ð ‘ ð ‘– ð ‘— | } reaches its minimum value. In order to solve the matrix nearness problem, the problem is reformulated to a min-max problem firstly, then the relationship between the min-max problem and a monotone linear variational inequality (LVI) is built. Since the matrix in the LVI problem has a special structure, a projection and contraction method is suggested to solve this LVI problem. Moreover, some implementing details of the method are presented in this paper. Finally, preliminary numerical results are reported, which show that this simple algorithm is promising for this matrix nearness problem.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AOR/2012/357954.pdf (application/pdf)
http://downloads.hindawi.com/journals/AOR/2012/357954.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaor:357954

DOI: 10.1155/2012/357954

Access Statistics for this article

More articles in Advances in Operations Research from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().