Displaying 21 – 40 of 43

Showing per page

On a regularization method for variational inequalities with P_0 mappings

Igor Konnov, Elena Mazurkevich, Mohamed Ali (2005)

International Journal of Applied Mathematics and Computer Science

We consider partial Browder-Tikhonov regularization techniques for variational inequality problems with P_0 cost mappings and box-constrained feasible sets. We present classes of economic equilibrium problems which satisfy such assumptions and propose a regularization method for these problems.

On the semilocal convergence of a two-step Newton-like projection method for ill-posed equations

Ioannis K. Argyros, Santhosh George (2013)

Applicationes Mathematicae

We present new semilocal convergence conditions for a two-step Newton-like projection method of Lavrentiev regularization for solving ill-posed equations in a Hilbert space setting. The new convergence conditions are weaker than in earlier studies. Examples are presented to show that older convergence conditions are not satisfied but the new conditions are satisfied.

Regularization of nonlinear ill-posed problems by exponential integrators

Marlis Hochbruck, Michael Hönig, Alexander Ostermann (2009)

ESAIM: Mathematical Modelling and Numerical Analysis

The numerical solution of ill-posed problems requires suitable regularization techniques. One possible option is to consider time integration methods to solve the Showalter differential equation numerically. The stopping time of the numerical integrator corresponds to the regularization parameter. A number of well-known regularization methods such as the Landweber iteration or the Levenberg-Marquardt method can be interpreted as variants of the Euler method for solving the Showalter differential...

Signal reconstruction from given phase of the Fourier transform using Fejér monotone methods

Dieter Schott (2000)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

The aim is to reconstruct a signal function x ∈ L₂ if the phase of the Fourier transform [x̂] and some additional a-priori information of convex type are known. The problem can be described as a convex feasibility problem. We solve this problem by different Fejér monotone iterative methods comparing the results and discussing the choice of relaxation parameters. Since the a-priori information is partly related to the spectral space the Fourier transform and its inverse have to be applied in each...

Structural Properties of Solutions to Total Variation Regularization Problems

Wolfgang Ring (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

In dimension one it is proved that the solution to a total variation-regularized least-squares problem is always a function which is "constant almost everywhere" , provided that the data are in a certain sense outside the range of the operator to be inverted. A similar, but weaker result is derived in dimension two.

The Perturbed Generalized Tikhonov's Algorithm

Alexandre, P. (1999)

Serdica Mathematical Journal

We work on the research of a zero of a maximal monotone operator on a real Hilbert space. Following the recent progress made in the context of the proximal point algorithm devoted to this problem, we introduce simultaneously a variable metric and a kind of relaxation in the perturbed Tikhonov’s algorithm studied by P. Tossings. So, we are led to work in the context of the variational convergence theory.

Currently displaying 21 – 40 of 43