In this paper, we give a characterization of strong convergence theorem of the Ishikawa iterative sequence with errors for the generalized set-valued variational inclusion problem involving a generalized set-valued qu...
详细信息
In this paper, we give a characterization of strong convergence theorem of the Ishikawa iterative sequence with errors for the generalized set-valued variational inclusion problem involving a generalized set-valued quasi-contractive mapping in a real Banach space. First, the existence of the solution of the generalized set-valued variational inclusion problem is proved. Then, using the existence result, the Ishikawa iterative algorithm with errors is constructed and the convergence of the iterative sequences is proved. Finally, numerical experiments are proposed to support the main result. The results improve and extend some known results.
A new class of bilevel generalized mixed equilibrium problems involving set-valued mappings is introduced and studied in Banach spaces. First, an auxiliary generalized mixed equilibrium problem (AGMEP) to compute the ...
详细信息
A new class of bilevel generalized mixed equilibrium problems involving set-valued mappings is introduced and studied in Banach spaces. First, an auxiliary generalized mixed equilibrium problem (AGMEP) to compute the approximate solutions of the generalized mixed equilibrium problems (GMEP) and bilevel generalized mixed equilibrium problems (BGMEP) involving set-valued mappings is introduced. By using a minimax inequality, the existence and uniqueness of solutions of the AGMEP is proved under quite mild conditions. By using auxiliary principle technique, new iterative algorithm to compute the approximate solutions of the GMEP and the BGMEP are suggested and analyzed. The strong convergence of the iterative sequences generated by the algorithms are proved under quite mild assumptions. These results are new and generalize some recent results in this field.
This paper concentrates on the target localization problem in a distributed multiple-input multiple-output radar system using the bistatic range (BR) measurements. By linearizing the BR measurements and considering th...
详细信息
This paper concentrates on the target localization problem in a distributed multiple-input multiple-output radar system using the bistatic range (BR) measurements. By linearizing the BR measurements and considering the relationship between the nuisance parameter and the target position, a constrained weighted least squares (CWLS) problem is formulated, which is an indefinite quadratically constrained quadratic programming problem. Since the constraint is non-convex, it is a nontrivial task to find the global solution. For this purpose, an improved Newton's method is applied to the CWLS problem to estimate the target position. Numerical simulations are included to examine the algorithm's performance and corroborate the theoretical developments.
In this paper, joint optimization of throughput and error rate via cooperative spectrum sensing in cognitive radio networks is investigated. An optimization problem is formulated, which aims to maximize the average ac...
详细信息
In this paper, joint optimization of throughput and error rate via cooperative spectrum sensing in cognitive radio networks is investigated. An optimization problem is formulated, which aims to maximize the average achievable throughput of cooperating cognitive users while keeping the error rate at a lower level. This is a multi-variable nonconvex optimization problem. Instead of solving it directly, we propose an iterative algorithm which jointly optimizes the threshold and sensing time together to decrease the effect of the error and to increase the achievable throughput. We first prove that the local error rate of the cognitive user is a convex function of energy threshold and determine a closed-form for the optimal threshold which minimizes the error rate. Then we show that the AND rule is the optimal fusion rule to maximize the achievable throughput. Furthermore we determine the least number of cooperating cognitive users that can guarantee a minimum target error rate. This initial nonconvex problem is converted into a single variable convex optimization problem which can be successfully solved by common methods e.g. Newton's method. Simulation results illustrate the fast convergence and effectiveness of the joint iterative algorithm. (c) 2012 Elsevier B.V. All rights reserved.
In this proceeding, we present the description of the numerical approach for resolution enhancement, field of view widening and noise reduction in pulse time-domain holography. The approach comprises iterative procedu...
详细信息
ISBN:
(数字)9781510618817
ISBN:
(纸本)9781510618817
In this proceeding, we present the description of the numerical approach for resolution enhancement, field of view widening and noise reduction in pulse time-domain holography. The approach comprises iterative procedure of the recorded hologram self-extrapolation into wider spatial area, and consecutive 'self-healing' of an object. The concept has been proofed on a synthetically generated pulse time-domain holograms. The proposed method is sought after, especially in THz range, where the distance between the object and the hologram lies in the order of several tens of wavelengths, and the detector sizes are usually limited, and with minor modifications can be applied for other THz holographic approaches.
In this paper, we give the notion of M-eta-proximal mapping for a nonconvex, proper, lower semicontinuous and subdifferentiable functional on Banach space, which is an extension of proximal mappings studied in [X. P. ...
详细信息
In this paper, we give the notion of M-eta-proximal mapping for a nonconvex, proper, lower semicontinuous and subdifferentiable functional on Banach space, which is an extension of proximal mappings studied in [X. P. Ding, F. Q. Xia, A new class of completely generalized quasi-variational inclusions in Banach spaces, J. Comput. Appl. Math. 147 (2002) 369-383;K. R. Kazmi, M. I. Bhat, Convergence and stability of iterative algorithms of generalized set-valued variational-like inclusions in Banach spaces, Appl. Math. Comput. 113 (2005) 153-165;K. R. Kazmi, M. I. Bhat, N. Ahmad, An iterative algorithm based on M-proximal mappings for a system of generalized implicit variational inclusions in Banach spaces, J. Comput. Appl. Math. 233 (2009) 361-371]. We prove its existence and Lipschitz continuity in reflexive Banach space. Further, we consider a system of generalized implicit variational-like inclusions in Banach spaces and show its equivalence with a system of implicit equations using the concept of M-eta-proximal mappings. Using this equivalence, we propose a new iterative algorithm for the system of generalized implicit variational-like inclusions. Furthermore, we prove the existence of solution of the system of generalized implicit variational-like inclusions and discuss the convergence and stability analysis of the iterative algorithm in the setting of uniformly smooth Banach spaces. (C) 2012 Elsevier Inc. All rights reserved.
In this letter, we introduce a fast and computationally efficient iterative algorithm for joint zero diagonalization of a set of complex-valued target matrices. The proposed algorithm is actually a low complexity vers...
详细信息
In this letter, we introduce a fast and computationally efficient iterative algorithm for joint zero diagonalization of a set of complex-valued target matrices. The proposed algorithm is actually a low complexity version of FJZD algorithm, it has a computational complexity of O(KN2), where K and N and are the number and dimension of the target matrices respectively. Moreover, the proposed algorithm is superior to FJZD in terms of interference to signal ratio. Simulation results demonstrate the good performance of the proposed algorithm.
In this paper, a cooperative power control scheme is proposed for two-user Gaussian interference channel (GIC) to mitigate the interference and improve the sum-rate. In the proposed scheme, codewords are divided into ...
详细信息
ISBN:
(纸本)9781538663585
In this paper, a cooperative power control scheme is proposed for two-user Gaussian interference channel (GIC) to mitigate the interference and improve the sum-rate. In the proposed scheme, codewords are divided into several segments. By jointly adjusting the power of each segment for the two users, the proposed scheme achieves a balance between increasing the entropy of signal and decreasing the entropy of interference, and thus maximizes the sum-rate. To solve the sum-rate maximization problem, an iterative algorithm combining both simulated annealing and gradient descent methods is also proposed. Numerical results show that the proposed scheme not only achieves higher sum-rate, but also provides better user fairness compared with the traditional schemes.
The acquisition of phase information of light field is the key technology of adaptive optics. Using intensity of the light field to derive the phase distribution of the light field has become a common application tech...
详细信息
ISBN:
(纸本)9781510622333
The acquisition of phase information of light field is the key technology of adaptive optics. Using intensity of the light field to derive the phase distribution of the light field has become a common application technique for phase recovery. Research shows that iterative algorithm is an effective method for phase recovery of light field, but some iterative algorithms have the disadvantages of being sensitive to initial values, easy to fall into local extremum and slow convergence. Here we mainly focus on two iterative optimization algorithms for wavefront distortion correction without wavefront sensing adaptive optics. The first is the Gerchberg-Saxton (GS) algorithm, which combines two complex amplitude distributions on the plane of the optical propagation perpendicular to the optical axis and recovers the phase from the intensity distribution. The second is a genetic algorithm that achieves an optimal solution for the evaluation function through a series of crossover, mutation, and selection operations. In order to improve its convergence rate, we take Zernike polynomial coefficient required for wavefront reconstruction as the optimization object instead of voltages on corrector traditionally. We numerically simulate the performance of two algorithms, use Zernike polynomial to fit the static aberration, and study a series of parameters, especially single-order aberrations and random multi-order aberrations as the initial phase to the correction performance, and the correction performance of the two algorithms is respectively evaluated using two evaluation functions, Sum-Square Error (SSE) and Strehl Ratio (SR). Time consumption is also mentioned to evaluate the performance of two algorithms.
A corner detection method is addressed in this paper. It is designed in order to construct a feature-based map which is applied to the simultaneous localization and mapping problem of mobile robots. With a iterative l...
详细信息
ISBN:
(纸本)9781728113128
A corner detection method is addressed in this paper. It is designed in order to construct a feature-based map which is applied to the simultaneous localization and mapping problem of mobile robots. With a iterative line segments extraction algorithm, the corner detection method has low time complexity and high accuracy. Results of experiment illustrate the effectiveness of the designed corner detection method.
暂无评论