577 search results - page 11 / 116 » New interval methods for constrained global optimization |
116
Voted
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
117
Voted
IMAMS
2007
15 years 5 months ago
2007
In this paper a method is presented to fair the limit surface of a subdivision algorithm around an extraordinary point. The eigenvalues and eigenvectors of the subdivision matrix d...
143
Voted
SIAMJO
2010
15 years 2 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...
155
Voted
NETWORKS
2008
15 years 3 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
103
Voted
MP
2007
15 years 3 months ago
2007
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of thousands of variables. In the paper [Haarala, Miettinen, M¨akel¨a,...