422 search results - page 32 / 85 » On Non-Approximability for Quadratic Programs |
PVM
2005
Springer
14 years 1 months ago
2005
Springer
We consider a parallel decomposition technique for solving the large quadratic programs arising in training the learning methodology Support Vector Machine. At each iteration of th...
EOR
2010
13 years 8 months ago
2010
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
MP
2006
13 years 8 months ago
2006
We present a time-stepping method to simulate rigid multibody dynamics with inelastic collision, contact, and friction. The method progresses with fixed time step without backtrac...
AUTOMATICA
2002
13 years 7 months ago
2002
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
SIAMJO
2010
13 years 6 months ago
2010
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...