Sciweavers

1177 search results - page 9 / 236
» Iterative methods for Robbins problems
Sort
View
AI
2006
Springer
13 years 7 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
STOC
2007
ACM
128views Algorithms» more  STOC 2007»
14 years 7 months ago
Iteratively constructing preconditioners via the conjugate gradient method
We consider the problem of solving a symmetric, positive definite system of linear equations. The most well-known and widely-used method for solving such systems is the preconditi...
John Dunagan, Nicholas J. A. Harvey
JCAM
2010
94views more  JCAM 2010»
13 years 2 months ago
Cascadic multilevel methods for ill-posed problems
Multilevel methods are popular for the solution of well-posed problems, such as certain boundary value problems for partial differential equations and Fredholm integral equations ...
Lothar Reichel, Andriy Shyshkov
IJKESDP
2010
149views more  IJKESDP 2010»
13 years 5 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
MP
2008
101views more  MP 2008»
13 years 7 months ago
Accelerating the cubic regularization of Newton's method on convex problems
In this paper we propose an accelerated version of the cubic regularization of Newton's method [6]. The original version, used for minimizing a convex function with Lipschitz...
Yu. Nesterov