B. Kalantari

activity

20122026

most citedSolving Linear System of Equations Via A Convex Hull Algorithm

5 citations · 34 across the 24 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.OC2019★ 5 cited

On the Equivalence of SDP Feasibility and a Convex Hull Relaxation for System of Quadratic Equations

Bahman Kalantari

We show {\it semidefinite programming} (SDP) feasibility problem is equivalent to solving a {\it convex hull relaxation} (CHR) for a finite system of quadratic equations. On the on…

math.OC2019

A Spectral Generalization of Von Neumann Minimax Theorem

Bahman Kalantari

Given $n \times n$ real symmetric matrices $A_{1}, \dots, A_{m}$ , the following {\it spectral minimax} property holds: $$\min_{X \in \mathbfΔ_n} \max_{y \in S_m} \sum_{i=1}^m y_iA_i \b…

math.OC2019★ 2 cited

A Triangle Algorithm for Semidefinite Version of Convex Hull Membership Problem

Bahman Kalantari

Given a subset $S = {A_{1}, \dots, A_{m}}$ of $S^{n}$ , the set of $n \times n$ real symmetric matrices, we define its {\it spectrahull} as the set $SH(\mathbf{S}) = \{p…