Advances in material science and intelligent systems have led to an increasing use of large-deflection flexible structures the aerospace industry, including flexible-wall wind tunnel nozzles, deformable wings, variable nozzles for aircraft engines. These attracted significant research interest due their aerodynamic performance, functional diversity, dynamic response characteristics that distinguish them from rigid structures. Large-deflection typically consist structural surfaces actuators....

In the present paper, we propose several kinds of adaptively relaxed iterative algorithms with a new step size for solving split feasibility problem in real Hilbert spaces. The proposed never terminate, while known existing literature may terminate. Several weak and strong convergence theorems have been established. Some numerical experiments are also included to illustrate effectiveness algorithms. MSC:46E20, 47J20, 47J25.

To effectively enhance the visual effect of infrared images, enrich image details, and interpretability, a multiscale Retinex enhancement method based on sequential guided filtering is proposed. Firstly, original decomposed into multiple-scale illumination images reflection theory. The at each scale are processed by low-pass adaptive gamma correction histogram, sequentially filtered. Finally, enhanced fused to obtain final result. Drawing idea processing, filter designed, in which previous...

The purpose of this paper is to present two new iterative algorithms find the minimum norm fixed point nonexpansive nonself-mappings in framework Hilbert spaces. results presented improve and extend corresponding ones announced by Yao Xu [Yao Y, HK. Iterative methods for finding mappings with applications. Optimization. 2011;60:645–658] many others. Some applications convex minimization split feast problems(SFP) are also included.

In this paper, we propose a new iteration method based on the hybrid steepest descent and Ishikawa-type for seeking solution of variational inequality involving Lipschitz continuous strongly monotone mapping set common fixed points finite family quasi-pseudocontractive mappings in real Hilbert space. MSC: 41A65, 47H17, 47J20.

In this paper, we introduce two kinds of iterative methods for finding the minimum-norm solution to standard monotone variational inequality problems in a real Hilbert space. We then prove that proposed converge strongly inequality. Finally, apply our results constrained minimization problem and split feasibility as well fixed point pseudocontractive mappings.

Abstract In the present paper, we propose three kinds of new algorithms for a finite family quasi-asymptotically pseudocontractive mappings in real Hilbert spaces. By using some analysis techniques, prove strong convergence proposed algorithms. Some numerical examples are also included to illustrate effectiveness The results presented this paper interesting extensions those well-known results.

In this paper, we introduce several types of viscosity approximation methods for nonexpansive nonself-mappings in certain Banach spaces. Using new analysis techniques, prove strong convergence theorems spaces without boundary conditions. MSC: 47H05, 47H09, 47H10.

Abstract In order to realize autonomy and intelligence for situation awareness, this paper proposes an intelligent awareness model based on fractional dimension information mining multidimensional reconstruction. First, some new concepts are proposed, the spatial perception is established by 3D reconstruction of input fusion information, 4D completes comprehension 5D seeks prediction. The three‐level estimation optimized a more robust flexible model. Combined with database system, reasoning...

We present a new algorithm for solving the two-set split common fixed point problem with total quasi-asymptotically pseudocontractive operators and consider case of quasi-pseudocontractive operators. Under some appropriate conditions, we prove that proposed algorithms have strong convergence. The results presented in this paper improve extend previous Censor Segal (2009), Moudafi (2011 2010), Mohammed (2013), Yang et al. (2011), Chang (2012), others.

In virtue of preconditioning technology, we propose a CQ algorithm for an extend split feasibility problem (ESFP). Comparing with the others, proposed can get faster convergence without considering to adjust stepsize. The is also established under mild conditions. Several extensions are presented. Moreover, present approximate variable preconditioner which does not compute matrix inverse. Finally, some numerical experiments show better behaviors methods. MSC:47J10, 47J20, 65B05.

With the rapid growth of science and technology, machine learning big data analysis have developed more difficult. Similarly, also become difficult to process classify due fact that dimension is becoming larger larger. Furthermore, aiming at defect amount clustering using speedy examine, search, discovery density peaks (also known as DPC) does not adjust sets with large dimensions (high-dimensional). Therefore, in this paper, we suggest an optimization procedure, which pronounce t-dpc,...

An optimal presetting method is proposed to improve the adaptation of Landweber algorithm. The Armijo-like search rule for accelerating CQ (nonempty closed convex sets C and Q) algorithm introduced. firstly calculates error at each step iterations. Then it presets number Afterward combines with result method. A new step-size better adaptive property can be obtained. It not only emphasizes rate beginning stages, but also still working later. Both methods were applied reconstruct Shepp-Logan...

Variable stepsize methods are effective for various modified CQ algorithms to solve the split feasibility problem (SFP). The purpose of this paper is first introduce two new simpler variable stepsizes algorithm. Then generalized which can cover former ones also proposed in real Hilbert spaces. And then, more general KM (Krasnosel’skii-Mann)-CQ presented. Several weak and strong convergence properties established. Moreover, some numerical experiments have been taken illustrate performance algorithms.

We introduce and study a new general split feasibility problem (GSFP) in Hilbert space. This generalizes the (SFP). The GSFP extends SFP with nonlinear continuous operator. apply preconditioning methods to increase efficiency of CQ algorithm, two algorithms for solving are presented. also propose inexact method approximate preconditioner. convergence theorems established under projections respect special norms. Some numerical results illustrate proposed methods. MSC:46E20, 47J20, 47J25, 47L50.

This paper is concerned with a new method to prove the weak convergence of strictly pseudo-contractive mapping in p-uniformly convex Banach space more relaxed restrictions on parameters. Our results extend and improve corresponding earlier results. MSC:41A65, 47H17, 47J20.