The Real Positive Definite Completion Problem Cycle Completability

The Real Positive Definite Completion Problem: Cycle Completability

Given a partial symmetric matrix, the positive definite completion problem asks if the unspecified entries in the matrix can be chosen so as to make the resulting matrix positive definite. Applications include probability and statistics, image enhancement, systems engineering, geophysics, and mathematical programming. The positive definite completion problem can also be viewed as a mechanism for addressing a fundamental problem in Euclidean geometry: which potential geometric configurations of vectors (i.e., configurations with angles between some vectors specified) are realizable in a Euclidean space. The positions of the specified entries in a partial matrix are naturally described by a graph. The question of existence of a positive definite completion was previously solved completely for the restrictive class of chordal graphs and this work solves the problem for the class of cycle completable graphs, a significant generalization of chordal graphs. These are graphs for which knowledge of completability for induced cycles (and cliques) implies completability of partial symmetric matrices with the given graph.

The Real Positive Definite Completion Problem

The Study of Minimax Inequalities and Applications to Economies and Variational Inequalities

This book provides a unified treatment for the study of the existence of equilibria of abstract economics in topological vector spaces from the viewpoint of Ky Fan minimax inequalities, which strongly depend on his infinite dimensional version of the classical Knaster, Kuratowski and Mazurkiewicz Lemma (KKM Lemma) in 1961. Studied are applications of general system versions of minimax inequalities and generalized quasi-variational inequalities, and random abstract economies and its applications to the system of random quasi-variational inequalities are given.