Sciweavers

13376 search results - page 225 / 2676
» Problem Solving with
Sort
View
118
Voted
MOC
2010
14 years 10 months ago
On a class of frozen regularized Gauss-Newton methods for nonlinear inverse problems
In this paper we consider a class of regularized Gauss-Newton methods for solving nonlinear inverse problems for which an a posteriori stopping rule is proposed to terminate the it...
Qinian Jin
MOC
2002
101views more  MOC 2002»
15 years 3 months ago
Global and uniform convergence of subspace correction methods for some convex optimization problems
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...
Xue-Cheng Tai, Jinchao Xu
118
Voted
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 8 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...
RC
1998
66views more  RC 1998»
15 years 3 months ago
An Interval Polynomial Interpolation Problem and Its Lagrange Solution
Numerical interpolation and approximation are powerful tools to solve real world application problems. To take data measurement errors into considerations of interpolating a d deg...
Chenyi Hu, Angelina Cardenas, Stephanie Hoogendoor...
IPL
2006
101views more  IPL 2006»
15 years 3 months ago
An efficient approximation for the Generalized Assignment Problem
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
Reuven Cohen, Liran Katzir, Danny Raz