Sciweavers

56 search results - page 1 / 12
» How good are interior point methods
Sort
View
MP
2008
61views more  MP 2008»
13 years 4 months ago
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
Abstract By refining a variant of the Klee
Antoine Deza, Eissa Nematollahi, Tamás Terl...
SIAMJO
2002
96views more  SIAMJO 2002»
13 years 4 months ago
A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
We introduce a new barrier function which is not a barrier function in the usual sense: it has finite value at the boundary of the feasible region. Despite this, its iteration bou...
Y. Q. Bai, Mohamed El Ghami, Cees Roos
ECCV
2008
Springer
14 years 6 months ago
Solving Image Registration Problems Using Interior Point Methods
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
Camillo J. Taylor, Arvind Bhusnurmath
CP
2005
Springer
13 years 10 months ago
From Linear Relaxations to Global Constraint Propagation
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...
Claude-Guy Quimper, Alejandro López-Ortiz
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
14 years 2 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...