7519 search results - page 348 / 1504 » Optimizing Generic Functions |
179
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
179
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract-- This paper considers the problem of model reduction for controlled systems. The paper considers a dual/adjoint formulation of the general optimization problem to minimiz...
151
click to vote
ESANN
2006
15 years 8 months ago
2006
In this paper, the problem of an optimal transformation of the input space for function approximation problems is addressed. The transformation is defined determining the Mahalanob...
151
click to vote
COLOGNETWENTE
2009
15 years 7 months ago
2009
We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objectiv...
142
click to vote
EOR
2008
15 years 6 months ago
2008
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory t...