197 search results - page 13 / 40 » Iterative method for solving a nonlinear boundary value prob... |
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
This paper presents a novel method to increase the accuracy
of linear fitting of implicit polynomials. The proposed
method is based on the 3L algorithm philosophy. The novelty
l...
AIPS
2006
13 years 10 months ago
2006
Researchers often express probabilistic planning problems as Markov decision process models and then maximize the expected total reward. However, it is often rational to maximize ...
SIAMJO
2010
13 years 7 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...
COCOS
2003
Springer
14 years 2 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
OL
2011
13 years 3 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...