In this paper, we apply the local fractional Adomian decomposition and variational iteration methods to obtain the analytic approximate solutions of Fredholm integral equations of the second kind within local fractional derivative operators. The iteration procedure is based on local fractional derivative. The obtained results reveal that the proposed methods are very efficient and simple tools ...

Introduction A promising new method for accelerated imaging, HighlY constrained backPRojection (HYPR) [1] uses the spatial information of a time averaged image (composite) to improve images at individual time frames. The original HYPR algorithm [1] was derived heuristically based on the idea that the location of the object was known using the composite image and that the role of the data from e...

large cardinal hypothesis used to prove I1~+1 determinacy in [MS] cannot be substantially improved. Our theorem is an application of the theory of core models or canonical inner models for large cardinal hypotheses. Our work develops further some of the basic ideas of this theory. The theory itself has many other applications, particularly in the realm of relative consistency results. (As a quo...

Anticipatory Optimization (AO) is a method for compiling compositions of abstract components (which are themselves composite data structures such as arrays, matrices, trees, record composites, etc.) so as to anticipate non-optimal structures in the compiled code (e.g., redundant iterations) and to compile the abstract components directly to optimized code without ever producing the non-optimal ...

In this article, we provide a splitting method for solving monotone inclusions in real Hilbert space involving four operators: maximally monotone, monotone-Lipschitzian, cocoercive, and monotone-continuous operator. The proposed takes advantage of the intrinsic properties each operator, generalizing forward–backward–half-forward Tseng’s algorithm with line search. At iteration, our defines step...

in this paper, we present a full newton step feasible interior-pointmethod for circular cone optimization by using euclidean jordanalgebra. the search direction is based on the nesterov-todd scalingscheme, and only full-newton step is used at each iteration.furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

This paper considers the problem of computing the real convex hull of a finite set of ndimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors. The proposed method consists in computing a sequence of automata representing approximations of the convex hull and using extrapolation techniques to compute the limit of this sequence. The conv...

We present a method for solving polynomial equations over idempotent ω-continuous semirings. The idea is to iterate over the semiring of functions rather than the semiring of interest, and only evaluate when needed. The key operation is substitution. In the initial step, we compute a linear completion of the system of equations that exhaustively inserts the equations into one another. With func...

Abstract In a real Hilbert space, let the VIP, GSVI, HVI, and CFPP denote variational inequality problem, general system of inequalities, hierarchical inequality, common fixed-point problem countable family uniformly Lipschitzian pseudocontractive mappings an asymptotically nonexpansive mapping, respectively. We design two Mann implicit composite subgradient extragradient algorithms with line-s...