350 search results - page 13 / 70 » On the symmetry function of a convex set |
SAGT
2010
Springer
14 years 9 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
97
Voted
EOR
2008
14 years 11 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
102
click to vote
JMLR
2006
14 years 11 months ago
2006
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
ICASSP
2011
IEEE
14 years 2 months ago
2011
IEEE
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
AUTOMATICA
2002
14 years 11 months ago
2002
This paper deals with the frequency domain properties of an ellipsoidal family of rational functions, i.e. a family of rational functions whose coefficients depend affinely on an ...