scholarly journals New results about semi-positive matrices

2016 ◽  
Vol 66 (3) ◽  
pp. 621-632 ◽  
Author(s):  
Jonathan Dorsey ◽  
Tom Gannon ◽  
Charles R. Johnson ◽  
Morrison Turnansky
Keyword(s):  
Positive Matrices

scholarly journals Zero-one completely positive matrices and the A(R, S) classes

2016 ◽  
Vol 4 (1) ◽  
Author(s):  
G. Dahl ◽  
T. A. Haufmann
Keyword(s):  
Related Concept ◽  
Completely Positive ◽  
Completely Positive Matrices ◽  
Positive Matrices

AbstractA matrix of the form A = BBT where B is nonnegative is called completely positive (CP). Berman and Xu (2005) investigated a subclass of CP-matrices, called f0, 1g-completely positive matrices. We introduce a related concept and show connections between the two notions. An important relation to the so-called cut cone is established. Some results are shown for f0, 1g-completely positive matrices with given graphs, and for {0,1}-completely positive matrices constructed from the classes of (0, 1)-matrices with fixed row and column sums.

scholarly journals A note on completely positive relaxations of quadratic problems in a multiobjective framework

2021 ◽  
Author(s):  
Gabriele Eichfelder ◽  
Patrick Groetzner
Keyword(s):  
Positive Semidefinite ◽  
Weighted Sum ◽  
Quadratic Problem ◽  
Completely Positive ◽  
Nonconvex Problems ◽  
Completely Positive Matrices ◽  
Convex Problems ◽  
Positive Matrices ◽  
Nondominated Points ◽  
Single Objective

AbstractIn a single-objective setting, nonconvex quadratic problems can equivalently be reformulated as convex problems over the cone of completely positive matrices. In small dimensions this cone equals the cone of matrices which are entrywise nonnegative and positive semidefinite, so the convex reformulation can be solved via SDP solvers. Considering multiobjective nonconvex quadratic problems, naturally the question arises, whether the advantage of convex reformulations extends to the multicriteria framework. In this note, we show that this approach only finds the supported nondominated points, which can already be found by using the weighted sum scalarization of the multiobjective quadratic problem, i.e. it is not suitable for multiobjective nonconvex problems.

scholarly journals Generalized even and odd totally positive matrices

2011 ◽  
Vol 435 (11) ◽  
pp. 2722-2730
Author(s):  
O.Y. Kushel ◽  
P. Sharma
Keyword(s):  
Totally Positive ◽  
Positive Matrices ◽  
Totally Positive Matrices

Powers of Positive Matrices

2018 ◽  
Vol 91 (3) ◽  
pp. 218-227
Author(s):  
Chris Bernhardt
Keyword(s):  
Positive Matrices

Positive Matrices

2017 ◽  
pp. 55-68
Author(s):  
András Bátkai ◽  
Marjeta Kramar Fijavž ◽  
Abdelaziz Rhandi
Keyword(s):  
Positive Matrices
Sign in / Sign up

Export Citation Format

Share Document