368 search results - page 8 / 74 » Some new iterative methods with three-order convergence |
SIAMSC
2008
13 years 7 months ago
2008
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
JOTA
2011
12 years 10 months ago
2011
Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an Outer Trust-Region (OTR) modification of A is the result of ...
SIAMSC
2008
13 years 7 months ago
2008
The Landweber method is a simple and flexible iterative regularization algorithm, whose projected variant provides nonnegative image reconstructions. Since the method is usually v...
MP
2007
13 years 7 months ago
2007
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of thousands of variables. In the paper [Haarala, Miettinen, M¨akel¨a,...
SIAMCO
2002
13 years 7 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...