Signal and image restoration problems are often solved by minimizing a cost function consisting of an `2 data-fidelity term and a regularization term. We consider a class of convex and edge-preserving regularization functions. In specific, half-quadratic regularization as a fixed-point iteration method is usually employed to solve this problem. The main aim of this paper is to solve the above-d...

we present a modified version of the infeasible-interior- we present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by mansouri et al. (nonlinear anal. real world appl. 12(2011) 545--561). each main step of the algorithm consists of a feasibility step and several centering steps. we use a different feasibility step, which targ...

*Correspondence: [email protected] Department of Mathematics and Information Education, National Taipei University of Education, Taipei, Taiwan Abstract On time scales, one area lacking of development is the method of finding solutions on partial dynamic equations. This paper proposes a method for finding the exact solution of linear partial dynamic equations on arbitrage time scales. We mod...

The input motion for seismic analysis of building structures is generally specified in design codes in terms of response spectrum. Therefore, real or simulated time histories for ground motions whose response spectrum matches approximately the design spectrum is desired. Among the various techniques currently available for generating spectrum compatible time histories it is possible to distingu...

In the present paper, we show that $S^*$ iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that this iteration method is equivalent to CR iteration method  and it produces a slow convergence rate compared to the CR iteration method for the class of almost contraction mappings. We also present table and graphic to support this result. F...

In this paper, we propose a modified prediction–correction method for structured monotone variational inequalities. This method is based on a reformulation of the normal prediction–correction method. Each iteration of the new method contains two predictions and a correction. At each iteration a new strategy is applied to obtain a proper step length. All the computing processes are easily implem...

in this paper, first a new homotopy perturbation method for solving a fractional order nonlinear telegraph equation is introduced. by applying the proposed method, the nonlinear equation is translated to linear equations for per iteration of homotopy perturbation method. then, the obtained problems are solved with separation method. in the examples, it is illustrated that the exact solution is ...

We consider the l1-regularized Markowitz model, where a l1-penalty term is added to the objective function of the classical mean-variance one to stabilize the solution process, promoting sparsity in the solution and avoiding short positions. In this paper, we consider the Bregman iteration method to solve the related constrained optimization problem. We propose an iterative algorithm based on a...

In this paper we present a primal interior-point hybrid proximal extragradient (HPE) method for solving a monotone variational inequality over a closed convex set endowed with a selfconcordant barrier and whose underlying map has Lipschitz continuous derivative. In contrast to the method of [7] in which each iteration required an approximate solution of a linearized variational inequality over ...