422 search results - page 51 / 85 » On Non-Approximability for Quadratic Programs |
MP
2008
13 years 8 months ago
2008
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
AAAI
2006
13 years 9 months 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...
AUTOMATICA
2007
13 years 8 months ago
2007
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...
JMLR
2006
13 years 8 months ago
2006
Parallel software for solving the quadratic program arising in training support vector machines for classification problems is introduced. The software implements an iterative dec...