299 search results - page 11 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
ANOR
2002
13 years 7 months ago
2002
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
SIAMNUM
2010
13 years 2 months ago
2010
In the solution of Fluid-Structure Interaction problems, partitioned procedures are modular algorithms that involve separate fluid and structure solvers, that interact, in an itera...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...