5 search results - page 1 / 1 » Universal duality in conic convex optimization |
MP
2007
13 years 4 months ago
2007
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
ICML
2004
IEEE
14 years 5 months ago
2004
IEEE
While classical kernel-based classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. ...
ORL
2006
13 years 4 months ago
2006
Using duality, we reformulate the asymmetric variational inequality (VI) problem over a conic region as an optimization problem. We give sufficient conditions for the convexity of...
MP
2008
13 years 4 months ago
2008
We consider two notions for the representations of convex cones: G-representation and liftedG-representation. The former represents a convex cone as a slice of another; the latter...
EOR
2010
13 years 4 months ago
2010
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...