5 search results - page 1 / 1 » Universal duality in conic convex optimization |
85
Voted
MP
2007
15 years 16 days 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...
110
Voted
ICML
2004
IEEE
16 years 1 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. ...
85
Voted
ORL
2006
15 years 28 days 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...
104
Voted
MP
2008
15 years 29 days 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...
117
click to vote
EOR
2010
15 years 1 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...