500 search results - page 4 / 100 » A parallel quadratic programming method for dynamic optimiza... |
122
Voted
SIAMJO
2010
14 years 11 months ago
2010
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
127
Voted
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
109
Voted
ICRA
1995
IEEE
15 years 4 months ago
1995
IEEE
The optimal motion generation problem is solved subject to various actuator constraints while the motion is constrained to an arbitrary path. The considered objective function is ...
133
Voted
JMLR
2010
14 years 8 months ago
2010
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...
111
Voted
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...