scholarly journals Characterization of Positive Definite and Semidefinite Matrices via Quadratic Programming Duality.

1982 ◽  
Author(s):  
S.-P. Han ◽  
O. L. Mangasarian
Keyword(s):  
Quadratic Programming ◽  
Positive Definite

scholarly journals A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming

2015 ◽  
Vol 07 (04) ◽  
pp. 1550050
Author(s):  
Carlos J. Luz
Keyword(s):  
Quadratic Programming ◽  
Discrete Math ◽  
Convex Quadratic Programming ◽  
Stability Number ◽  
Weighted Version ◽  
Similar Characterization ◽  
Number Formula ◽  
Weighted Stability ◽  
Theta Number

For any graph [Formula: see text] Luz and Schrijver [A convex quadratic characterization of the Lovász theta number, SIAM J. Discrete Math. 19(2) (2005) 382–387] introduced a characterization of the Lovász number [Formula: see text] based on convex quadratic programming. A similar characterization is now established for the weighted version of the number [Formula: see text] independently introduced by McEliece, Rodemich, and Rumsey [The Lovász bound and some generalizations, J. Combin. Inform. Syst. Sci. 3 (1978) 134–152] and Schrijver [A Comparison of the Delsarte and Lovász bounds, IEEE Trans. Inform. Theory 25(4) (1979) 425–429]. Also, a class of graphs for which the weighted version of [Formula: see text] coincides with the weighted stability number is characterized.

A polynomial algorithm for the quadratic programming problem

2014 ◽  
Vol 29 (3) ◽  
Author(s):  
Valentin A. Bereznev
Keyword(s):  
Computational Complexity ◽  
Quadratic Form ◽  
Quadratic Programming ◽  
Programming Problem ◽  
Polynomial Complexity ◽  
Polynomial Algorithm ◽  
Positive Definite Matrix ◽  
Positive Definite ◽  
Quadratic Programming Problem ◽  
Convex Polyhedral Cone

AbstractAn approach based on projection of a vector onto a pointed convex polyhedral cone is proposed for solving the quadratic programming problem with a positive definite matrix of the quadratic form. It is proved that this method has polynomial complexity. A method is said to be of polynomial computational complexity if the solution to the problem can be obtained in N

scholarly journals Positive Definite Norm Dependent Matrices In Stochastic Modeling

2014 ◽  
Vol 47 (1) ◽  
Author(s):  
Sebastian P. Kuniewski ◽  
Jolanta K. Misiewicz
Keyword(s):  
Stochastic Modeling ◽  
Mathematical Analysis ◽  
Spatial Data ◽  
Correlation Matrix ◽  
Positive Definiteness ◽  
Positive Definite ◽  
Necessary Condition ◽  
The Family ◽  
Definite Correlation

AbstractPositive definite norm dependent matrices are of interest in stochastic modeling of distance/norm dependent phenomena in nature. An example is the application of geostatistics in geographic information systems or mathematical analysis of varied spatial data. Because the positive definiteness is a necessary condition for a matrix to be a valid correlation matrix, it is desirable to give a characterization of the family of the distance/norm dependent functions that form a valid (positive definite) correlation matrix. Thus, the main reason for writing this paper is to give an overview of characterizations of norm dependent real functions and consequently norm dependent matrices, since this information is somehow hidden in the theory of geometry of Banach spaces

Free group C*-algebras associated with ℓp

2014 ◽  
Vol 25 (07) ◽  
pp. 1450065 ◽  
Author(s):  
Rui Okayasu
Keyword(s):  
Free Group ◽  
Positive Definite ◽  
Positive Definite Functions ◽  
Linear Functionals ◽  
C Algebra ◽  
Tracial State ◽  
C Algebras ◽  
Positive Linear Functionals ◽  
The Ideal

For every p ≥ 2, we give a characterization of positive definite functions on a free group with finitely many generators, which can be extended to positive linear functionals on the free group C*-algebra associated with the ideal ℓp. This is a generalization of Haagerup's characterization for the case of the reduced free group C*-algebra. As a consequence, the canonical quotient map between the associated C*-algebras is not injective, and they have a unique tracial state.

On graph products of multipliers and the Haagerup property for -dynamical systems

2019 ◽  
Vol 40 (12) ◽  
pp. 3188-3216
Author(s):  
SCOTT ATKINSON
Keyword(s):  
Dynamical Systems ◽  
Positive Definite ◽  
Alternative Proof ◽  
Discrete Groups ◽  
Graph Products ◽  
Graph Product ◽  
Haagerup Property ◽  
Products Of Groups ◽  
Product Action

We consider the notion of the graph product of actions of discrete groups $\{G_{v}\}$ on a $C^{\ast }$-algebra ${\mathcal{A}}$ and show that under suitable commutativity conditions the graph product action $\star _{\unicode[STIX]{x1D6E4}}\unicode[STIX]{x1D6FC}_{v}:\star _{\unicode[STIX]{x1D6E4}}G_{v}\curvearrowright {\mathcal{A}}$ has the Haagerup property if each action $\unicode[STIX]{x1D6FC}_{v}:G_{v}\curvearrowright {\mathcal{A}}$ possesses the Haagerup property. This generalizes the known results on graph products of groups with the Haagerup property. To accomplish this, we introduce the graph product of multipliers associated to the actions and show that the graph product of positive-definite multipliers is positive definite. These results have impacts on left-transformation groupoids and give an alternative proof of a known result for coarse embeddability. We also record a cohomological characterization of the Haagerup property for group actions.

Sign in / Sign up

Export Citation Format

Share Document