6 search results - page 1 / 2 » On the facet-to-facet property of solutions to convex parame... |
AUTOMATICA
2006
13 years 4 months ago
2006
In some of the recently-developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regio...
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
A quadratic programming formulation for multiclass image segmentation is investigated. It is proved that, in the convex case, the non-negativity constraint on the recent reported ...
MP
2011
12 years 11 months ago
2011
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
MP
2002
13 years 4 months ago
2002
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...