An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programmin...An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programming with equilibrium constraints （MPEC）. The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium （UE） model. The idea of the proposed DDIA is to reduce the dimensions of the problem. A group of variables （discrete/continuous） are fixed to altemately optimize another group of variables （continuous/discrete）. Some continuous network design problems （CNDPs） and discrete network design problems （DNDPs） are solved repeatedly until the optimal solution is obtained. A numerical example is given to demonstrate the efficiency of the proposed algorithm.展开更多
A numerical method is proposed to simulate the transverse vibrations of a viscoelastic moving string constituted by an integral law. In the numerical computation, the Galerkin method based on the Hermite functions is ...A numerical method is proposed to simulate the transverse vibrations of a viscoelastic moving string constituted by an integral law. In the numerical computation, the Galerkin method based on the Hermite functions is applied to discretize the state variables, and the Runge- Kutta method is applied to solve the resulting differential-integral equation system. A linear iterative process is designed to compute the integral terms at each time step, which makes the numerical method more efficient and accurate. As examples, nonlinear parametric vibrations of an axially moving viscoelastic string are analyzed.展开更多
An auxiliary principle technique to study a class of generalized set-valued strongly nonlinear mixed variational-like inequalities is extended. The existence and uniqueness of the solution of the auxiliary problem for...An auxiliary principle technique to study a class of generalized set-valued strongly nonlinear mixed variational-like inequalities is extended. The existence and uniqueness of the solution of the auxiliary problem for the generalized set-valued strongly nonlinear mixed variational-like inequalities are proved, a novel and innovative three-step iterative algorithm to compute approximate solution is constructed, and the existence of the solution of the generalized set-valued strongly nonlinear mixed variational-like inequality is shown using the auxiliary principle iterative sequences generated by the algorithm technique. The convergence of three-step is also proved.展开更多
A proximal iterative algorithm for the mulitivalue operator equation 0∈T(x)is presented,where T is a maximal monotone operator.It is an improvement of the proximal point algorithm as well know.The convergence of the ...A proximal iterative algorithm for the mulitivalue operator equation 0∈T(x)is presented,where T is a maximal monotone operator.It is an improvement of the proximal point algorithm as well know.The convergence of the algorithm is discussed and all example is given.展开更多
Metal objects in X-ray computed tomography can cause severe artifacts.The state-of-the-art metal artifact reduction methods are in the sinogram inpainting category and are iterative methods.This paper proposes a proje...Metal objects in X-ray computed tomography can cause severe artifacts.The state-of-the-art metal artifact reduction methods are in the sinogram inpainting category and are iterative methods.This paper proposes a projectiondomain algorithm to reduce the metal artifacts.In this algorithm,the unknowns are the metal-affected projections,while the objective function is set up in the image domain.The data fidelity term is not utilized in the objective function.The objective function of the proposed algorithm consists of two terms:the total variation of the metalremoved image and the energy of the negative-valued pixels in the image.After the metal-affected projections are modified,the final image is reconstructed via the filtered backprojection algorithm.The feasibility of the proposed algorithm has been verified by real experimental data.展开更多
This paper proposes a novel iterative algorithm for optimal design of non-frequency-selective Finite Impulse Response(FIR) digital filters based on the windowing method.Different from the traditional optimization conc...This paper proposes a novel iterative algorithm for optimal design of non-frequency-selective Finite Impulse Response(FIR) digital filters based on the windowing method.Different from the traditional optimization concept of adjusting the window or the filter order in the windowing design of an FIR digital filter,the key idea of the algorithm is minimizing the approximation error by succes-sively modifying the design result through an iterative procedure under the condition of a fixed window length.In the iterative procedure,the known deviation of the designed frequency response in each iteration from the ideal frequency response is used as a reference for the next iteration.Because the approximation error can be specified variably,the algorithm is applicable for the design of FIR digital filters with different technical requirements in the frequency domain.A design example is employed to illustrate the efficiency of the algorithm.展开更多
This paper concerns computational problems of the concave penalized linear regression model.We propose a fixed point iterative algorithm to solve the computational problem based on the fact that the penalized estimato...This paper concerns computational problems of the concave penalized linear regression model.We propose a fixed point iterative algorithm to solve the computational problem based on the fact that the penalized estimator satisfies a fixed point equation.The convergence property of the proposed algorithm is established.Numerical studies are conducted to evaluate the finite sample performance of the proposed algorithm.展开更多
In this paper, an iterative algorithm is presented to solve the Sylvester and Lyapunov matrix equations. By this iterative algorithm, for any initial matrix X1, a solution X＊ can be obtained within finite iteration s...In this paper, an iterative algorithm is presented to solve the Sylvester and Lyapunov matrix equations. By this iterative algorithm, for any initial matrix X1, a solution X＊ can be obtained within finite iteration steps in the absence of roundoff errors. Some examples illustrate that this algorithm is very efficient and better than that of [ 1 ] and [2].展开更多
A new system of generalized mixed implicit equilibrium problems （SGMIEP） involving nonmonotone set-valued mappings is introduced and studied in real reflexive Banach spaces. First, an auxiliary mixed equilibrium pro...A new system of generalized mixed implicit equilibrium problems （SGMIEP） involving nonmonotone set-valued mappings is introduced and studied in real reflexive Banach spaces. First, an auxiliary mixed equilibrium problem （AMEP） is introduced. The existence and the uniqueness of the solutions to the AMEP are proved under quite mild assumptions without any coercive conditions. Next, by using the solution mapping of the AMEP, a system of generalized equation problems （SGEP） is considered, and its equivalence with the SGMIEP is shown. By using the SGEP, a new iterative algorithm for solving the SGMIEP is proposed and analyzed. The strong convergence of the iterative sequences generated by the algorithm is proved under suitable conditions. These results are new, which unify and generalize some recent results in this field.展开更多
In this study,an iterative algorithm is proposed to solve the nonlinear matrix equation X+A∗eXA=In.Explicit expressions for mixed and componentwise condition numbers with their upper bounds are derived to measure the ...In this study,an iterative algorithm is proposed to solve the nonlinear matrix equation X+A∗eXA=In.Explicit expressions for mixed and componentwise condition numbers with their upper bounds are derived to measure the sensitivity of the considered nonlinear matrix equation.Comparative analysis for the derived condition numbers and the proposed algorithm are presented.The proposed iterative algorithm reduces the number of iterations significantly when incorporated with exact line searches.Componentwise condition number seems more reliable to detect the sensitivity of the considered equation than mixed condition number as validated by numerical examples.展开更多
In this paper we use the auxiliary principle technique to suggest and analyze novel and innovative iterative algorithms for a class of nonlinear variational inequalities. Several special cases, which can be obtained f...In this paper we use the auxiliary principle technique to suggest and analyze novel and innovative iterative algorithms for a class of nonlinear variational inequalities. Several special cases, which can be obtained from our main results, are also discussed.展开更多
In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared wi...In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples.展开更多
It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used suc...It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.展开更多
StrongH-tensors play a significant role in identifying the positive definiteness of an even-order real symmetric tensor.In this paper,first,an improved iterative algorithm is proposed to determine whether a given tens...StrongH-tensors play a significant role in identifying the positive definiteness of an even-order real symmetric tensor.In this paper,first,an improved iterative algorithm is proposed to determine whether a given tensor is a strong H-tensor,and the validity of the iterative algorithm is proved theoretically.Second,the iterative algorithm is employed to identify the positive definiteness of an even-order real symmetric tensor.Finally,numerical examples are presented to illustrate the advantages of the proposed algorithm.展开更多
As an emerging trend in power grid development,the AC/DC hybrid power grid presents the characteristics of multi-type DC links and large-scale AC/DC interconnection.However,existing research on AC/DC power flow calcul...As an emerging trend in power grid development,the AC/DC hybrid power grid presents the characteristics of multi-type DC links and large-scale AC/DC interconnection.However,existing research on AC/DC power flow calculation is mainly based on single-object models,ignoring the complex interactions and interdependencies between the AC system and various types of DC links in the hybrid power grid,such as LCCHVDC,MMC-HVDC,and LCC-MMC hybrid HVDC.Therefore,this paper proposes a power flow calculation algorithm for large-scale AC/DC systems with multi-type DC links.Firstly,a CIM/XML document conversion strategy applicable to the AC/DC system is proposed.Then,a unified modeling method is used to derive the power flow model of the AC/DC system,and a unified iterative algorithm for the large-scale AC/DC system with multi-type DC links is proposed.Finally,the algorithm’s correctness and effectiveness are verified by comparing it with actual measurements from the Southern Power Grid of China,with a voltage deviation of less than 1%.The research shows that the proposed algorithm has good convergence and high computational efficiency,which is applicable to power flow calculations in large-scale DC-embedded hybrid AC/DC grids in the future.展开更多
Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant ...Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant threats to SI,among which DDoS attack will intensify the erosion of limited bandwidth resources.Therefore,this paper proposes a DDoS attack tracking scheme using a multi-round iterative Viterbi algorithm to achieve high-accuracy attack path reconstruction and fast internal source locking,protecting SI from the source.Firstly,to reduce communication overhead,the logarithmic representation of the traffic volume is added to the digests after modeling SI,generating the lightweight deviation degree to construct the observation probability matrix for the Viterbi algorithm.Secondly,the path node matrix is expanded to multi-index matrices in the Viterbi algorithm to store index information for all probability values,deriving the path with non-repeatability and maximum probability.Finally,multiple rounds of iterative Viterbi tracking are performed locally to track DDoS attack based on trimming tracking results.Simulation and experimental results show that the scheme can achieve 96.8%tracking accuracy of external and internal DDoS attack at 2.5 seconds,with the communication overhead at 268KB/s,effectively protecting the limited bandwidth resources of SI.展开更多
Metasurfaces,which are the two-dimensional counterparts of metamaterials,have demonstrated unprecedented capabilities to manipulate the wavefront of electromagnetic waves in a single flat device.Despite various advanc...Metasurfaces,which are the two-dimensional counterparts of metamaterials,have demonstrated unprecedented capabilities to manipulate the wavefront of electromagnetic waves in a single flat device.Despite various advances in this field,the unique functionalities achieved by metasurfaces have come at the cost of the structural complexity,resulting in a time-consuming parameter sweep for the conventional metasurface design.Although artificial neural networks provide a flexible platform for significantly improving the design process,the current metasurface designs are restricted to generating qualitative field distributions.In this study,we demonstrate that by combining a tandem neural network and an iterative algorithm,the previous restriction of the design of metasurfaces can be overcome with quantitative field distributions.As proof-of-principle examples,metalenses predicted via the designed network architecture that possess multiple focal points with identical/orthogonal polarisation states,as well as accurate intensity ratios(quantitative field distributions),were numerically calculated and experimentally demonstrated.The unique and robust approach for the metasurface design will enable the acceleration of the development of devices with high-accuracy functionalities,which can be applied in imaging,detecting,and sensing.展开更多
A general A-P iterative algorithm in a shift-invariant space is presented. We use the algorithm to show reconstruction of signals from weighted samples and also show that the general improved algorithm has better conv...A general A-P iterative algorithm in a shift-invariant space is presented. We use the algorithm to show reconstruction of signals from weighted samples and also show that the general improved algorithm has better convergence rate than the existing one. An explicit estimate for a guaranteed rate of convergence is given.展开更多
The purpose of this paper is to investigate the iterative algorithm for finding approximate solutions of a class of mixed variational-like inequalities in a real Hilbert space, where the iterative algorithm is present...The purpose of this paper is to investigate the iterative algorithm for finding approximate solutions of a class of mixed variational-like inequalities in a real Hilbert space, where the iterative algorithm is presented by virtue of the auxiliary principle technique. On one hand, the existence of approximate solutions of this class of mixed variational-like inequalities is proven. On the other hand, it is shown that the approximate solutions converge strongly to the exact solution of this class of mixed variational-like inequalities.展开更多
基金The National Natural Science Foundation of China(No. 50908235 )China Postdoctoral Science Foundation (No.201003520)
文摘An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programming with equilibrium constraints （MPEC）. The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium （UE） model. The idea of the proposed DDIA is to reduce the dimensions of the problem. A group of variables （discrete/continuous） are fixed to altemately optimize another group of variables （continuous/discrete）. Some continuous network design problems （CNDPs） and discrete network design problems （DNDPs） are solved repeatedly until the optimal solution is obtained. A numerical example is given to demonstrate the efficiency of the proposed algorithm.
基金supported by the National Outstanding Young Scientists Fund of China (No. 10725209)the National ScienceFoundation of China (No. 10672092)+1 种基金Shanghai Municipal Education Commission Scientific Research Project (No. 07ZZ07)Shanghai Leading Academic Discipline Project (No. Y0103).
文摘A numerical method is proposed to simulate the transverse vibrations of a viscoelastic moving string constituted by an integral law. In the numerical computation, the Galerkin method based on the Hermite functions is applied to discretize the state variables, and the Runge- Kutta method is applied to solve the resulting differential-integral equation system. A linear iterative process is designed to compute the integral terms at each time step, which makes the numerical method more efficient and accurate. As examples, nonlinear parametric vibrations of an axially moving viscoelastic string are analyzed.
基金Project supported by the National Natural Science Foundation of China (No.10472061)
文摘An auxiliary principle technique to study a class of generalized set-valued strongly nonlinear mixed variational-like inequalities is extended. The existence and uniqueness of the solution of the auxiliary problem for the generalized set-valued strongly nonlinear mixed variational-like inequalities are proved, a novel and innovative three-step iterative algorithm to compute approximate solution is constructed, and the existence of the solution of the generalized set-valued strongly nonlinear mixed variational-like inequality is shown using the auxiliary principle iterative sequences generated by the algorithm technique. The convergence of three-step is also proved.
基金Supported by the National Natural Science Foundation of China
文摘A proximal iterative algorithm for the mulitivalue operator equation 0∈T(x)is presented,where T is a maximal monotone operator.It is an improvement of the proximal point algorithm as well know.The convergence of the algorithm is discussed and all example is given.
基金This research is partially supported by NIH,No.R15EB024283.
文摘Metal objects in X-ray computed tomography can cause severe artifacts.The state-of-the-art metal artifact reduction methods are in the sinogram inpainting category and are iterative methods.This paper proposes a projectiondomain algorithm to reduce the metal artifacts.In this algorithm,the unknowns are the metal-affected projections,while the objective function is set up in the image domain.The data fidelity term is not utilized in the objective function.The objective function of the proposed algorithm consists of two terms:the total variation of the metalremoved image and the energy of the negative-valued pixels in the image.After the metal-affected projections are modified,the final image is reconstructed via the filtered backprojection algorithm.The feasibility of the proposed algorithm has been verified by real experimental data.
基金the National Grand Fundamental Research 973 Program of China (No.2004CB318109)the National High-Technology Research and Development Plan of China (No.2006AA01Z452)
文摘This paper proposes a novel iterative algorithm for optimal design of non-frequency-selective Finite Impulse Response(FIR) digital filters based on the windowing method.Different from the traditional optimization concept of adjusting the window or the filter order in the windowing design of an FIR digital filter,the key idea of the algorithm is minimizing the approximation error by succes-sively modifying the design result through an iterative procedure under the condition of a fixed window length.In the iterative procedure,the known deviation of the designed frequency response in each iteration from the ideal frequency response is used as a reference for the next iteration.Because the approximation error can be specified variably,the algorithm is applicable for the design of FIR digital filters with different technical requirements in the frequency domain.A design example is employed to illustrate the efficiency of the algorithm.
基金Supported by the National Natural Science Foundation of China(11701571)
文摘This paper concerns computational problems of the concave penalized linear regression model.We propose a fixed point iterative algorithm to solve the computational problem based on the fact that the penalized estimator satisfies a fixed point equation.The convergence property of the proposed algorithm is established.Numerical studies are conducted to evaluate the finite sample performance of the proposed algorithm.
基金supported by the National Natural Science Foundation of China (No.10771073)
文摘In this paper, an iterative algorithm is presented to solve the Sylvester and Lyapunov matrix equations. By this iterative algorithm, for any initial matrix X1, a solution X＊ can be obtained within finite iteration steps in the absence of roundoff errors. Some examples illustrate that this algorithm is very efficient and better than that of [ 1 ] and [2].
基金Project supported by the Sichuan Province Leading Academic Discipline Project(No.SZD0406)the Scientific Research Fund of Sichuan Normal University(No.11ZDL01)
文摘A new system of generalized mixed implicit equilibrium problems （SGMIEP） involving nonmonotone set-valued mappings is introduced and studied in real reflexive Banach spaces. First, an auxiliary mixed equilibrium problem （AMEP） is introduced. The existence and the uniqueness of the solutions to the AMEP are proved under quite mild assumptions without any coercive conditions. Next, by using the solution mapping of the AMEP, a system of generalized equation problems （SGEP） is considered, and its equivalence with the SGMIEP is shown. By using the SGEP, a new iterative algorithm for solving the SGMIEP is proposed and analyzed. The strong convergence of the iterative sequences generated by the algorithm is proved under suitable conditions. These results are new, which unify and generalize some recent results in this field.
文摘In this study,an iterative algorithm is proposed to solve the nonlinear matrix equation X+A∗eXA=In.Explicit expressions for mixed and componentwise condition numbers with their upper bounds are derived to measure the sensitivity of the considered nonlinear matrix equation.Comparative analysis for the derived condition numbers and the proposed algorithm are presented.The proposed iterative algorithm reduces the number of iterations significantly when incorporated with exact line searches.Componentwise condition number seems more reliable to detect the sensitivity of the considered equation than mixed condition number as validated by numerical examples.
文摘In this paper we use the auxiliary principle technique to suggest and analyze novel and innovative iterative algorithms for a class of nonlinear variational inequalities. Several special cases, which can be obtained from our main results, are also discussed.
基金Project supported by the National Natural Science Foundation of China （Grant No.10271074）, and the Special Funds for Major Specialities of Shanghai Education Commission （Grant No.J50101）
文摘In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples.
文摘It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.
文摘StrongH-tensors play a significant role in identifying the positive definiteness of an even-order real symmetric tensor.In this paper,first,an improved iterative algorithm is proposed to determine whether a given tensor is a strong H-tensor,and the validity of the iterative algorithm is proved theoretically.Second,the iterative algorithm is employed to identify the positive definiteness of an even-order real symmetric tensor.Finally,numerical examples are presented to illustrate the advantages of the proposed algorithm.
基金supported by the Science and Technology Project of China Southern Power Grid(ZDKJXM20200052).
文摘As an emerging trend in power grid development,the AC/DC hybrid power grid presents the characteristics of multi-type DC links and large-scale AC/DC interconnection.However,existing research on AC/DC power flow calculation is mainly based on single-object models,ignoring the complex interactions and interdependencies between the AC system and various types of DC links in the hybrid power grid,such as LCCHVDC,MMC-HVDC,and LCC-MMC hybrid HVDC.Therefore,this paper proposes a power flow calculation algorithm for large-scale AC/DC systems with multi-type DC links.Firstly,a CIM/XML document conversion strategy applicable to the AC/DC system is proposed.Then,a unified modeling method is used to derive the power flow model of the AC/DC system,and a unified iterative algorithm for the large-scale AC/DC system with multi-type DC links is proposed.Finally,the algorithm’s correctness and effectiveness are verified by comparing it with actual measurements from the Southern Power Grid of China,with a voltage deviation of less than 1%.The research shows that the proposed algorithm has good convergence and high computational efficiency,which is applicable to power flow calculations in large-scale DC-embedded hybrid AC/DC grids in the future.
基金supported by the National Key R&D Program of China(Grant No.2022YFA1005000)the National Natural Science Foundation of China(Grant No.62025110 and 62101308).
文摘Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant threats to SI,among which DDoS attack will intensify the erosion of limited bandwidth resources.Therefore,this paper proposes a DDoS attack tracking scheme using a multi-round iterative Viterbi algorithm to achieve high-accuracy attack path reconstruction and fast internal source locking,protecting SI from the source.Firstly,to reduce communication overhead,the logarithmic representation of the traffic volume is added to the digests after modeling SI,generating the lightweight deviation degree to construct the observation probability matrix for the Viterbi algorithm.Secondly,the path node matrix is expanded to multi-index matrices in the Viterbi algorithm to store index information for all probability values,deriving the path with non-repeatability and maximum probability.Finally,multiple rounds of iterative Viterbi tracking are performed locally to track DDoS attack based on trimming tracking results.Simulation and experimental results show that the scheme can achieve 96.8%tracking accuracy of external and internal DDoS attack at 2.5 seconds,with the communication overhead at 268KB/s,effectively protecting the limited bandwidth resources of SI.
基金the National Key Research and Development Program of China(2017YFA0701005)National Natural Science Foundation of China(62271320,61871268)+1 种基金“Shuguang”Program of Shanghai Education Commission(19SG44)the 111 Project(D18014).
文摘Metasurfaces,which are the two-dimensional counterparts of metamaterials,have demonstrated unprecedented capabilities to manipulate the wavefront of electromagnetic waves in a single flat device.Despite various advances in this field,the unique functionalities achieved by metasurfaces have come at the cost of the structural complexity,resulting in a time-consuming parameter sweep for the conventional metasurface design.Although artificial neural networks provide a flexible platform for significantly improving the design process,the current metasurface designs are restricted to generating qualitative field distributions.In this study,we demonstrate that by combining a tandem neural network and an iterative algorithm,the previous restriction of the design of metasurfaces can be overcome with quantitative field distributions.As proof-of-principle examples,metalenses predicted via the designed network architecture that possess multiple focal points with identical/orthogonal polarisation states,as well as accurate intensity ratios(quantitative field distributions),were numerically calculated and experimentally demonstrated.The unique and robust approach for the metasurface design will enable the acceleration of the development of devices with high-accuracy functionalities,which can be applied in imaging,detecting,and sensing.
基金This work is supported in part by the National Natural Science Foundation of China （10771190, 10801136）, the Mathematical Tianyuan Foundation of China NSF （10526036）, China Postdoctoral Science Foundation （20060391063）, Natural Science Foundation of Guangdong Province （07300434）
文摘A general A-P iterative algorithm in a shift-invariant space is presented. We use the algorithm to show reconstruction of signals from weighted samples and also show that the general improved algorithm has better convergence rate than the existing one. An explicit estimate for a guaranteed rate of convergence is given.
文摘The purpose of this paper is to investigate the iterative algorithm for finding approximate solutions of a class of mixed variational-like inequalities in a real Hilbert space, where the iterative algorithm is presented by virtue of the auxiliary principle technique. On one hand, the existence of approximate solutions of this class of mixed variational-like inequalities is proven. On the other hand, it is shown that the approximate solutions converge strongly to the exact solution of this class of mixed variational-like inequalities.
