422 search results - page 25 / 85 » On Non-Approximability for Quadratic Programs |
159
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
149
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems ar...
153
Voted
IFIP
2005
Springer
15 years 10 months ago
2005
Springer
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...
143
Voted
SIAMJO
2008
15 years 4 months ago
2008
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
128
Voted
EVOW
2010
Springer
15 years 6 months ago
2010
Springer
We present a multi-parent hybrid genetic