symmetric positive semidefinite

MOR
2002

72views more MOR 2002»

An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems

13 years 4 months ago

Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex b...

Jie Sun, Kim-Chuan Toh, Gongyun Zhao

claim paper

Read More »

click to vote

SODA
2010
ACM

149views Algorithms» more SODA 2010»

Sharp kernel clustering algorithms and their associated Grothendieck inequalities

14 years 2 months ago

Download www.cims.nyu.edu

abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...

Subhash Khot, Assaf Naor

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers