299 search results - page 5 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
MP
2008
13 years 7 months ago
2008
We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be dir...
MP
2006
13 years 7 months ago
2006
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
CPAIOR
2009
Springer
14 years 2 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
ACCV
2007
Springer
14 years 1 months ago
2007
Springer
This is a survey paper summarizing recent research aimed at finding guaranteed optimal algorithms for solving problems in Multiview Geometry. Many of the traditional problems in M...