A variational approach for restoring images corrupted by noisy blur kernels and additive noise

In this paper, we study a deblurring algorithm for distorted images by random impulse response. We propose and develop a convex optimization model to recover the underlying image and the blurring function simultaneously. The objective function is composed of 3 terms: the data‐fitting term between the observed image and the product of the estimated blurring function and the estimated image, the squared difference between the estimated blurring function and its mean, and the total variation regularization term for the estimated image. We theoretically show that under some mild conditions, the resulting objective function can be convex in which the global minimum value is unique. The numerical results confirm that the peak‐to‐signal‐noise‐ratio and structural similarity of the restored images by the proposed algorithm are the best when the proposed objective function is convex. We also present a proximal alternating minimization scheme to solve the resulting minimization problem. Numerical examples are presented to demonstrate the effectiveness of the proposed model and the efficiency of the numerical scheme.     

A practicable branch-and-bound algorithm for globally solving linear multiplicative programming

To globally solve linear multiplicative programming problem (LMP), this paper presents a practicable branch-and-bound method based on the framework of branch-and-bound algorithm. In this method, a new linear relaxation technique is proposed firstly. Then, the branch-and-bound algorithm is developed for solving problem LMP. The proposed algorithm is proven that it is convergent to the global minimum by means of the subsequent solutions of a series of linear programming problems. Some experiments are reported to show the feasibility and efficiency of this algorithm.     

A new non-divergence diffusion equation with variable exponent for multiplicative noise removal

A new kind of model based on double degenerate parabolic equation in nondivergence form is proposed for multiplicative noise removal. We first utilize the regularization method to illustrate the existence of the weak solution for the problem and the non-expansion of support of the solution is also provided. In the numerical aspect, experiments and comparisons with other denoising models are presented in order to state the denoising capability of our model.     

Fixed-point smoothing algorithm for discrete multiplicative systems

A fixed-point smoothing algorithm is proven for discretetime systems with additive and multiplicative noise in the plant and measurement equations. Such systems, although linear, differ in a number of aspects from systems with only additive noise. The algorithm depends on the multiplicative terms, as expected. Steady-state results are derived.     

Finite algorithm for generalized linear multiplicative programming

The nonconvex problem of minimizing the sum of a linear function and the product of two linear functions over a convex polyhedron is considered. A finite algorithm is proposed which either finds a global optimum or shows that the objective function is unbounded from below in the feasible region. This is done by means of a sequence of primal and/or dual simplex iterations.The first author gratefully acknowledges the research support received as Visiting Professor of the Dipartimento di Statistica e Matematica Applicata all' Economia, Universitá di Pisa, Pisa, Italy, Spring 1992.     

Newton's method for stochastic semilinear wave equations driven by multiplicative time-space noise

Semilinear wave equations with additive or one-dimensional noise are treatable by various iterative and numerical methods. We study more difficult models of semilinear wave equations with infinite dimensional multiplicative spatially correlated noise. Our proof of probabilistic second-order convergence of some iterative methods is based on Da Prato and Zabczyk's maximal inequalities.     

Harnack inequalities for functional SDEs with multiplicative noise and applications

By constructing a new coupling, the log-Harnack inequality is established for the functional solution of a delay stochastic differential equation with multiplicative noise. As applications, the strong Feller property and heat kernel estimates w.r.t. quasi-invariant probability measures are derived for the associated transition semigroup of the solution. The dimension-free Harnack inequality in the sense of Wang (1997) [14] is also investigated.     

LP-stabilization problem for linear stochastic control systems with multiplicative noise

For the deterministic case, a linear controlled system is alwayspth order stable as long as we use the control obtained as the solution of the so-called LQ-problem. For the stochastic case, however, a linear controlled system with multiplicative noise is not alwayspth mean stable for largep, even if we use the LQ-optimal control. Hence, it is meaningful to solve the LP-optimal control problem (i.e., linear system,pth order cost functional) for eachp. In this paper, we define the LP-optimal control problem and completely solve it for the scalar case. For the multidimensional case, we get some results, but the general solution of this problem seems to be impossible. So, we consider thepth mean stabilization problem more intensively and give a sufficient condition for the existence of apth mean stabilizing control by using the contraction mapping method in a Hilbert space. Some examples are also given.This research was conducted while the author was a visitor at the Forschungsschwerpunkt Dynamische Systeme, Universität Bremen, Bremen, West Germany. The author is grateful to Professor L. Arnold for providing interesting seminars and excellent working conditions during his stay. The financial assistance given by the Alexander von Humboldt Foundation during the author's stay is also gratefully acknowledged.     

Approximation of stationary solutions to SDEs driven by multiplicative fractional noise

In a previous paper, we studied the ergodic properties of an Euler scheme of a stochastic differential equation with a Gaussian additive noise in order to approximate the stationary regime of such an equation. We now consider the case of multiplicative noise when the Gaussian process is a fractional Brownian motion with Hurst parameter H>1/2$H>1/2$ and obtain some (functional) convergence properties of some empirical measures of the Euler scheme to the stationary solutions of such SDEs.     

Anisotropy-based bounded real lemma for discrete-time systems with multiplicative noise

A model of a discrete-time system with multiplicative noise is considered. For this model, a condition is derived under which the anisotropic norm of the system is bounded by the anisotropic norm of an auxiliary linear discrete-time stationary system with parametric uncertainty. Conditions for the anisotropic norm of the system with multiplicative noise to be bounded by a given positive number are obtained in terms of solutions of linear matrix inequalities and a single equation.     

Analysis of a new variational model for multiplicative noise removal

In this paper we consider a new variational model for multiplicative noise removal. We prove the existence and uniqueness of the minimizer for the variational problem. Furthermore, we derive the existence and uniqueness of weak solutions for the associated evolution equation. Finally, some numerical experiments are shown to compare the proposed model with the model given by Aubert and Aujol.     

Log-Harnack inequality for mild solutions of SPDEs with multiplicative noise

Due to technical reasons, existing results concerning Harnack type inequalities for SPDEs with multiplicative noise apply only to the case where the coefficient in the noise term is a Hilbert–Schmidt perturbation of a constant bounded operator. In this paper we obtained gradient estimates, log-Harnack inequality for mild solutions of general SPDEs with multiplicative noise whose coefficient is even allowed to be unbounded which cannot be Hilbert–Schmidt. Applications to stochastic reaction–diffusion equations driven by space–time white noise are presented.     

Attractors for stochastic lattice dynamical systems with a multiplicative noise

In this paper, we consider a stochastic lattice differential equation with diffusive nearest neighbor interaction, a dissipative nonlinear reaction term, and multiplicative white noise at each node. We prove the existence of a compact global random attractor which, pulled back, attracts tempered random bounded sets.      

A stochastic approximation algorithm with multiplicative step size modification

An algorithm of searching a zero of an unknown function ϕ: ℝ → ℝ is considered: x _t = x _t−1 − γ _t−1 y _t , t = 1, 2, ..., where y _t = ϕ(x _t−1) + ξ _t is the value of ϕ measured at x _t−1 and ξ _t is the measurement error. The step sizes γ _t > 0 are modified in the course of the algorithm according to the rule: γ _t = min{uγ _t−1, } if y _t−1 y _t > 0, and γ _t = dγ _t−1, otherwise, where 0 < d < 1 < u, > 0. That is, at each iteration γ _t is multiplied either by u or by d, provided that the resulting value does not exceed the predetermined value . The function ϕ may have one or several zeros; the random values ξ _t are independent and identically distributed, with zero mean and finite variance. Under some additional assumptions on ϕ, ξ _t , and , the conditions on u and d guaranteeing a.s. convergence of the sequence {x _t }, as well as a.s. divergence, are determined. In particular, if P(ξ ₁ > 0) = P (ξ ₁ < 0) = 1/2 and P(ξ ₁ = x) = 0 for any x ∈ ℝ, one has convergence for ud < 1 and divergence for ud > 1. Due to the multiplicative updating rule for γ _t , the sequence {x _t } converges rapidly: like a geometric progression (if convergence takes place), but the limit value may not coincide with, but instead, approximate one of the zeros of ϕ. By adjusting the parameters u and d, one can reach arbitrarily high precision of the approximation; higher accuracy is obtained at the expense of lower convergence rate.      

A family of fully implicit Milstein methods for stiff stochastic differential equations with multiplicative noise

In this paper a family of fully implicit Milstein methods are introduced for solving stiff stochastic differential equations (SDEs). It is proved that the methods are convergent with strong order 1.0 for a class of SDEs. For a linear scalar test equation with multiplicative noise terms, mean-square and almost sure asymptotic stability of the methods are also investigated. We combine analytical and numerical techniques to get insights into the stability properties. The fully implicit methods are shown to be superior to those of the corresponding semi-implicit methods in term of stability property. Finally, numerical results are reported to illustrate the convergence and stability results.     

Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations

Given a set of corrupted data drawn from a union of multiple subspace, the subspace recovery problem is to segment the data into their respective subspace and to correct the possible noise simultaneously. Recently, it is discovered that the task can be characterized, both theoretically and numerically, by solving a matrix nuclear-norm and a ?_2,1-mixed norm involved convex minimization problems. The minimization model actually has separable structure in both the objective function and constraint; it thus falls into the framework of the augmented Lagrangian alternating direction approach. In this paper, we propose and investigate an augmented Lagrangian algorithm. We split the augmented Lagrangian function and minimize the subproblems alternatively with one variable by fixing the other one. Moreover, we linearize the subproblem and add a proximal point term to easily derive the closed-form solutions. Global convergence of the proposed algorithm is established under some technical conditions. Extensive experiments on the simulated and the real data verify that the proposed method is very effective and faster than the sate-of-the-art algorithm LRR.     

Random attractors for stochastic sine-Gordon lattice systems with multiplicative white noise

We study the asymptotic behavior of solutions to the stochastic sine-Gordon lattice equations with multiplicative white noise. We first prove the existence and uniqueness of solutions, and then establish the existence of tempered random bounded absorbing sets and global random attractors.     

Random attractor for a two-dimensional incompressible non-Newtonian fluid with multiplicative noise

This article proves that the random dynamical system generated by a twodimensional incompressible non-Newtonian fluid with multiplicative noise has a global random attractor, which is a random compact set absorbing any bounded nonrandom subset of the phase space.