116 search results - page 14 / 24 » Reformulation and convex relaxation techniques for global op... |
NIPS
2001
13 years 9 months ago
2001
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
AUTOMATICA
2004
13 years 7 months ago
2004
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
ICCV
2009
IEEE
15 years 20 days ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
AROBOTS
2002
13 years 7 months ago
2002
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
ANOR
2005
13 years 7 months ago
2005
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...