161 search results - page 9 / 33 » Methods for convex and general quadratic programming |
103
click to vote
AAAI
2006
15 years 14 days ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
118
click to vote
MP
2002
14 years 10 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...
80
Voted
ICML
2007
IEEE
15 years 12 months ago
2007
IEEE
Although support vector machines (SVMs) for binary classification give rise to a decision rule that only relies on a subset of the training data points (support vectors), it will ...
JMLR
2006
14 years 11 months ago
2006
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
202
click to vote
OL
2011
14 years 6 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...