Computing the distance between the linear matrix pencil and the completely positive cone

Jinyan Fan () and Anwa Zhou ()
Additional contact information
Jinyan Fan: Shanghai Jiao Tong University
Anwa Zhou: Shanghai Jiao Tong University

Computational Optimization and Applications, 2016, vol. 64, issue 3, No 2, 647-670

Abstract: Abstract In this paper, we consider the problem of computing the distance between the linear matrix pencil and the completely positive cone. We formulate it as a linear optimization problem with the cone of moments and the second order cone. A semidefinite relaxation algorithm is presented and the convergence is studied. We also propose a new model for checking the membership in the completely positive cone.

Keywords: Completely positive matrices; CP projection; Linear matrix pencil; Linear optimization with moments; Semidefinite algorithm; Primary 15A22; 15A23; 44A60; 90C22; 90C26; 90C59 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-016-9825-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:coopap:v:64:y:2016:i:3:d:10.1007_s10589-016-9825-1

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-016-9825-1

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().