Results

**1 - 2**of**2**
by B Kalantari

Sorted by:

Results **1 -
2** of
**2**

by
B Kalantari
, 2005

"... ..."

(Show Context)
Citation Context

...hm described in [7], but from a fresh point of view. For the extension of the algorithm to semidefinite programming see [5], and for its extension to much more general convex programming problems see =-=[6]-=-. Consider the problem of computing a nonnegative nontrivial zero of a given positive semidefinite symmetric n × n matrix, Q. This is equivalent to testing if µ = min{φ(x) = 1 2 xT Qx : x ≥ 0, �x� = 1...

by
Yi Jin, Bahman Kalantari

"... ..."

(Show Context)
Citation Context

...an be tested via a single homogeneous feasibility problem. We close by mentioning that since matrix scaling dualities such as the one used in Theorem 2.1 have been extended to more general cones, see =-=[6,7]-=-, it is quite likely that Chvátal’s Procedure and Theorem 2.1 are extendible to more general problems as well. Thus, despite their simplicity, we anticipate that Chvátal’s Procedure and Theorem 2.1 ha...

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University