161 search results - page 22 / 33 » Methods for convex and general quadratic programming |
176
click to vote
TOG
2012
13 years 6 months ago
2012
We present a physically-based system to simulate and control the locomotion of soft body characters without skeletons. We use the finite element method to simulate the deformatio...
139
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
164
click to vote
JMLR
2012
13 years 6 months ago
2012
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
133
click to vote
CASES
2010
ACM
15 years 2 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
167
click to vote
SIAMJO
2002
15 years 4 months ago
2002
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...