Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design...Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.展开更多
In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and di...In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.展开更多
In this paper, we present continuous iteratively reweighted least squares algorithm (CIRLS) for solving the linear models problem by convex relaxation, and prove the convergence of this algorithm. Under some condition...In this paper, we present continuous iteratively reweighted least squares algorithm (CIRLS) for solving the linear models problem by convex relaxation, and prove the convergence of this algorithm. Under some conditions, we give an error bound for the algorithm. In addition, the numerical result shows the efficiency of the algorithm.展开更多
The normal direction to the normal direction to a line in Minkowski geometries generally does not give the original line. We show that in lp geometries with p>1?repeatedly finding the normal line through the origin...The normal direction to the normal direction to a line in Minkowski geometries generally does not give the original line. We show that in lp geometries with p>1?repeatedly finding the normal line through the origin gives sequences of lines that monotonically approach specific lines of symmetry of the unit circle. Which lines of symmetry that are approached depends upon the value of p and the slope of the initial line.展开更多
This paper proposed a feedback feedforward Iterative Learning Control(ILC)law for nonlinear system with iteratively variable trial lengths under a networked systems structure,where the both sensor and actuator occurs ...This paper proposed a feedback feedforward Iterative Learning Control(ILC)law for nonlinear system with iteratively variable trial lengths under a networked systems structure,where the both sensor and actuator occurs random data lost separately.The feedforward ILC part includes the calculated input signal,actual input signal,and the modified tracking error of last iteration.Some tracking signal would be lost at last iteration because of the iterative varying trial lengths.In order to offset the missing signal of last trial,the tracking error of present trial is adopted by feedback control part.It is established that the convergence relied on the feedforward control gain merely,while the rate of convergence is also expedited by the feedback control component.When the initial state expectation equals to the reference one,it is established that the tracking error expectation can be controlled to zero.With an illustrative simulation,the effectiveness of the developed algorithm can be demonstrated.展开更多
In this paper,we consider the maximal positive definite solution of the nonlinear matrix equation.By using the idea of Algorithm 2.1 in ZHANG(2013),a new inversion-free method with a stepsize parameter is proposed to ...In this paper,we consider the maximal positive definite solution of the nonlinear matrix equation.By using the idea of Algorithm 2.1 in ZHANG(2013),a new inversion-free method with a stepsize parameter is proposed to obtain the maximal positive definite solution of nonlinear matrix equation X+A^(*)X|^(-α)A=Q with the case 0<α≤1.Based on this method,a new iterative algorithm is developed,and its convergence proof is given.Finally,two numerical examples are provided to show the effectiveness of the proposed method.展开更多
In this paper,we present local functional law of the iterated logarithm for Cs?rg?-Révész type increments of fractional Brownian motion.The results obtained extend works of Gantert[Ann.Probab.,1993,21(2):104...In this paper,we present local functional law of the iterated logarithm for Cs?rg?-Révész type increments of fractional Brownian motion.The results obtained extend works of Gantert[Ann.Probab.,1993,21(2):1045-1049]and Monrad and Rootzén[Probab.Theory Related Fields,1995,101(2):173-192].展开更多
High-resolution seeing through complex scattering media such as turbid water,biological tissues,and mist is a significant challenge because the strong scattering scrambles the light paths and forms the scattering wall...High-resolution seeing through complex scattering media such as turbid water,biological tissues,and mist is a significant challenge because the strong scattering scrambles the light paths and forms the scattering wall.We propose an active polarized iterative optimization approach for high-resolution imaging through complex scattering media.By acquiring a series of sub-polarized images,we can capture the diverse pattern-illuminated images with various high-frequency component information caused by the Brownian motion of complex scattering materials,which are processed using the common-mode rejection of polarization characteristics to extract target information from scattering medium information.Following that,our computational reconstruction technique employs an iterative optimization algorithm that commences with patternilluminated Fourier ptychography for reconstructing the high-resolution scene.It is extremely important that our approach for high-resolution imaging through complex scattering media is not limited by priori information and optical memory effect.The proposed approach is suitable for not only dynamic but also static scattering media,which may find applications in the biomedicine field,such as skin abnormalities,non-invasive blood flow,and superficial tumors.展开更多
This work proposes the application of an iterative learning model predictive control(ILMPC)approach based on an adaptive fault observer(FOBILMPC)for fault-tolerant control and trajectory tracking in air-breathing hype...This work proposes the application of an iterative learning model predictive control(ILMPC)approach based on an adaptive fault observer(FOBILMPC)for fault-tolerant control and trajectory tracking in air-breathing hypersonic vehicles.In order to increase the control amount,this online control legislation makes use of model predictive control(MPC)that is based on the concept of iterative learning control(ILC).By using offline data to decrease the linearized model’s faults,the strategy may effectively increase the robustness of the control system and guarantee that disturbances can be suppressed.An adaptive fault observer is created based on the suggested ILMPC approach in order to enhance overall fault tolerance by estimating and compensating for actuator disturbance and fault degree.During the derivation process,a linearized model of longitudinal dynamics is established.The suggested ILMPC approach is likely to be used in the design of hypersonic vehicle control systems since numerical simulations have demonstrated that it can decrease tracking error and speed up convergence when compared to the offline controller.展开更多
The increased demand for personalized customization calls for new production modes to enhance collaborations among a wide range of manufacturing practitioners who unnecessarily trust each other.In this article,a block...The increased demand for personalized customization calls for new production modes to enhance collaborations among a wide range of manufacturing practitioners who unnecessarily trust each other.In this article,a blockchain-enabled manufacturing collaboration framework is proposed,with a focus on the production capacity matching problem for blockchainbased peer-to-peer(P2P)collaboration.First,a digital model of production capacity description is built for trustworthy and transparent sharing over the blockchain.Second,an optimization problem is formulated for P2P production capacity matching with objectives to maximize both social welfare and individual benefits of all participants.Third,a feasible solution based on an iterative double auction mechanism is designed to determine the optimal price and quantity for production capacity matching with a lack of personal information.It facilitates automation of the matching process while protecting users'privacy via blockchainbased smart contracts.Finally,simulation results from the Hyperledger Fabric-based prototype show that the proposed approach increases social welfare by 1.4%compared to the Bayesian game-based approach,makes all participants profitable,and achieves 90%fairness of enterprises.展开更多
A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the s...A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the spatial spectrum and the directions of arrival(DOA)of interferences to overcome the drawbacks associated with conventional adaptive beamforming(ABF)methods.The mainlobe interferences are identified by calculating the correlation coefficients between direction steering vectors(SVs)and rejected by the BMP pretreatment.Then,IAA is subsequently employed to reconstruct a sidelobe interference-plus-noise covariance matrix for the preferable ABF and residual interference suppression.Simulation results demonstrate the excellence of the proposed method over normal methods based on BMP and eigen-projection matrix perprocessing(EMP)under both uncorrelated and coherent circumstances.展开更多
The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because o...The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.展开更多
Missing data are a problem in geophysical surveys, and interpolation and reconstruction of missing data is part of the data processing and interpretation. Based on the sparseness of the geophysical data or the transfo...Missing data are a problem in geophysical surveys, and interpolation and reconstruction of missing data is part of the data processing and interpretation. Based on the sparseness of the geophysical data or the transform domain, we can improve the accuracy and stability of the reconstruction by transforming it to a sparse optimization problem. In this paper, we propose a mathematical model for the sparse reconstruction of data based on the LO-norm minimization. Furthermore, we discuss two types of the approximation algorithm for the LO- norm minimization according to the size and characteristics of the geophysical data： namely, the iteratively reweighted least-squares algorithm and the fast iterative hard thresholding algorithm. Theoretical and numerical analysis showed that applying the iteratively reweighted least-squares algorithm to the reconstruction of potential field data exploits its fast convergence rate, short calculation time, and high precision, whereas the fast iterative hard thresholding algorithm is more suitable for processing seismic data, moreover, its computational efficiency is better than that of the traditional iterative hard thresholding algorithm.展开更多
The lattice parameter,measured with sufficient accuracy,can be utilized to evaluate the quality of single crystals and to determine the equation of state for materials.We propose an iterative method for obtaining more...The lattice parameter,measured with sufficient accuracy,can be utilized to evaluate the quality of single crystals and to determine the equation of state for materials.We propose an iterative method for obtaining more precise lattice parameters using the interaction points for the pseudo-Kossel pattern obtained from laser-induced X-ray diffraction(XRD).This method has been validated by the analysis of an XRD experiment conducted on iron single crystals.Furthermore,the method was used to calculate the compression ratio and rotated angle of an LiF sample under high pressure loading.This technique provides a robust tool for in-situ characterization of structural changes in single crystals under extreme conditions.It has significant implications for studying the equation of state and phase transitions.展开更多
In this paper,a new technique is introduced to construct higher-order iterative methods for solving nonlinear systems.The order of convergence of some iterative methods can be improved by three at the cost of introduc...In this paper,a new technique is introduced to construct higher-order iterative methods for solving nonlinear systems.The order of convergence of some iterative methods can be improved by three at the cost of introducing only one additional evaluation of the function in each step.Furthermore,some new efficient methods with a higher-order of convergence are obtained by using only a single matrix inversion in each iteration.Analyses of convergence properties and computational efficiency of these new methods are made and testified by several numerical problems.By comparison,the new schemes are more efficient than the corresponding existing ones,particularly for large problem sizes.展开更多
基金Project supported by the National Natural Science Foundation of China(No.61603322)the Research Foundation of Education Bureau of Hunan Province of China(No.16C1542)
文摘Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.
基金national natural science foundation natural science foundation of Gansu province.
文摘In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.
文摘In this paper, we present continuous iteratively reweighted least squares algorithm (CIRLS) for solving the linear models problem by convex relaxation, and prove the convergence of this algorithm. Under some conditions, we give an error bound for the algorithm. In addition, the numerical result shows the efficiency of the algorithm.
文摘The normal direction to the normal direction to a line in Minkowski geometries generally does not give the original line. We show that in lp geometries with p>1?repeatedly finding the normal line through the origin gives sequences of lines that monotonically approach specific lines of symmetry of the unit circle. Which lines of symmetry that are approached depends upon the value of p and the slope of the initial line.
基金supported by the National Natural Science Foundation of China(Nos.61903096 and 62173101)the Key Laboratory of On-Chip Communication and Sensor Chip of Guangdong Higher Education Institutes(No.2023KSYS002).
文摘This paper proposed a feedback feedforward Iterative Learning Control(ILC)law for nonlinear system with iteratively variable trial lengths under a networked systems structure,where the both sensor and actuator occurs random data lost separately.The feedforward ILC part includes the calculated input signal,actual input signal,and the modified tracking error of last iteration.Some tracking signal would be lost at last iteration because of the iterative varying trial lengths.In order to offset the missing signal of last trial,the tracking error of present trial is adopted by feedback control part.It is established that the convergence relied on the feedforward control gain merely,while the rate of convergence is also expedited by the feedback control component.When the initial state expectation equals to the reference one,it is established that the tracking error expectation can be controlled to zero.With an illustrative simulation,the effectiveness of the developed algorithm can be demonstrated.
基金Supported in part by Natural Science Foundation of Guangxi(2023GXNSFAA026246)in part by the Central Government's Guide to Local Science and Technology Development Fund(GuikeZY23055044)in part by the National Natural Science Foundation of China(62363003)。
文摘In this paper,we consider the maximal positive definite solution of the nonlinear matrix equation.By using the idea of Algorithm 2.1 in ZHANG(2013),a new inversion-free method with a stepsize parameter is proposed to obtain the maximal positive definite solution of nonlinear matrix equation X+A^(*)X|^(-α)A=Q with the case 0<α≤1.Based on this method,a new iterative algorithm is developed,and its convergence proof is given.Finally,two numerical examples are provided to show the effectiveness of the proposed method.
基金Supported by NSFC(Nos.11661025,12161024)Natural Science Foundation of Guangxi(Nos.2020GXNSFAA159118,2021GXNSFAA196045)+2 种基金Guangxi Science and Technology Project(No.Guike AD20297006)Training Program for 1000 Young and Middle-aged Cadre Teachers in Universities of GuangxiNational College Student's Innovation and Entrepreneurship Training Program(No.202110595049)。
文摘In this paper,we present local functional law of the iterated logarithm for Cs?rg?-Révész type increments of fractional Brownian motion.The results obtained extend works of Gantert[Ann.Probab.,1993,21(2):1045-1049]and Monrad and Rootzén[Probab.Theory Related Fields,1995,101(2):173-192].
基金supported by the National Natural Science Foundation of China(Grant Nos.62205259,62075175,62105254,and 62375212)the National Key Laboratory of Infrared Detection Technologies(Grant No.IRDT-23-06)+1 种基金the Fundamental Research Funds for the Central Universities(Grant Nos.XJSJ24028,XJS222202,ZYTS24097,and ZYTS24095)the Open Research Fund of Beijing Key Laboratory of Advanced Optical Remote Sensing Technology.
文摘High-resolution seeing through complex scattering media such as turbid water,biological tissues,and mist is a significant challenge because the strong scattering scrambles the light paths and forms the scattering wall.We propose an active polarized iterative optimization approach for high-resolution imaging through complex scattering media.By acquiring a series of sub-polarized images,we can capture the diverse pattern-illuminated images with various high-frequency component information caused by the Brownian motion of complex scattering materials,which are processed using the common-mode rejection of polarization characteristics to extract target information from scattering medium information.Following that,our computational reconstruction technique employs an iterative optimization algorithm that commences with patternilluminated Fourier ptychography for reconstructing the high-resolution scene.It is extremely important that our approach for high-resolution imaging through complex scattering media is not limited by priori information and optical memory effect.The proposed approach is suitable for not only dynamic but also static scattering media,which may find applications in the biomedicine field,such as skin abnormalities,non-invasive blood flow,and superficial tumors.
基金supported by the National Natural Science Foundation of China(12072090).
文摘This work proposes the application of an iterative learning model predictive control(ILMPC)approach based on an adaptive fault observer(FOBILMPC)for fault-tolerant control and trajectory tracking in air-breathing hypersonic vehicles.In order to increase the control amount,this online control legislation makes use of model predictive control(MPC)that is based on the concept of iterative learning control(ILC).By using offline data to decrease the linearized model’s faults,the strategy may effectively increase the robustness of the control system and guarantee that disturbances can be suppressed.An adaptive fault observer is created based on the suggested ILMPC approach in order to enhance overall fault tolerance by estimating and compensating for actuator disturbance and fault degree.During the derivation process,a linearized model of longitudinal dynamics is established.The suggested ILMPC approach is likely to be used in the design of hypersonic vehicle control systems since numerical simulations have demonstrated that it can decrease tracking error and speed up convergence when compared to the offline controller.
基金supported in part by the National Natural Science Foundation of China(62273310)the Natural Science Foundation of Zhejiang Province of China(LY22F030006,LZ24F030009)
文摘The increased demand for personalized customization calls for new production modes to enhance collaborations among a wide range of manufacturing practitioners who unnecessarily trust each other.In this article,a blockchain-enabled manufacturing collaboration framework is proposed,with a focus on the production capacity matching problem for blockchainbased peer-to-peer(P2P)collaboration.First,a digital model of production capacity description is built for trustworthy and transparent sharing over the blockchain.Second,an optimization problem is formulated for P2P production capacity matching with objectives to maximize both social welfare and individual benefits of all participants.Third,a feasible solution based on an iterative double auction mechanism is designed to determine the optimal price and quantity for production capacity matching with a lack of personal information.It facilitates automation of the matching process while protecting users'privacy via blockchainbased smart contracts.Finally,simulation results from the Hyperledger Fabric-based prototype show that the proposed approach increases social welfare by 1.4%compared to the Bayesian game-based approach,makes all participants profitable,and achieves 90%fairness of enterprises.
基金The National Natural Science Foundation of China(No.U19B2031).
文摘A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the spatial spectrum and the directions of arrival(DOA)of interferences to overcome the drawbacks associated with conventional adaptive beamforming(ABF)methods.The mainlobe interferences are identified by calculating the correlation coefficients between direction steering vectors(SVs)and rejected by the BMP pretreatment.Then,IAA is subsequently employed to reconstruct a sidelobe interference-plus-noise covariance matrix for the preferable ABF and residual interference suppression.Simulation results demonstrate the excellence of the proposed method over normal methods based on BMP and eigen-projection matrix perprocessing(EMP)under both uncorrelated and coherent circumstances.
基金supported in part by the National Key Research and Development Program of China under Grant No.2021YFF0901300in part by the National Natural Science Foundation of China under Grant Nos.62173076 and 72271048.
文摘The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.
文摘A survey of recent progress on the multiplicity and stability problems for closed characteristics on compact convex hypersurfaces in R^(2n) is given.
基金supported by the National Natural Science Foundation of China (Grant No.41074133)
文摘Missing data are a problem in geophysical surveys, and interpolation and reconstruction of missing data is part of the data processing and interpretation. Based on the sparseness of the geophysical data or the transform domain, we can improve the accuracy and stability of the reconstruction by transforming it to a sparse optimization problem. In this paper, we propose a mathematical model for the sparse reconstruction of data based on the LO-norm minimization. Furthermore, we discuss two types of the approximation algorithm for the LO- norm minimization according to the size and characteristics of the geophysical data： namely, the iteratively reweighted least-squares algorithm and the fast iterative hard thresholding algorithm. Theoretical and numerical analysis showed that applying the iteratively reweighted least-squares algorithm to the reconstruction of potential field data exploits its fast convergence rate, short calculation time, and high precision, whereas the fast iterative hard thresholding algorithm is more suitable for processing seismic data, moreover, its computational efficiency is better than that of the traditional iterative hard thresholding algorithm.
基金National Natural Science Foundation of China(12102410)Fund of National Key Laboratory of Shock Wave and Detonation Physics(JCKYS2022212005)。
文摘The lattice parameter,measured with sufficient accuracy,can be utilized to evaluate the quality of single crystals and to determine the equation of state for materials.We propose an iterative method for obtaining more precise lattice parameters using the interaction points for the pseudo-Kossel pattern obtained from laser-induced X-ray diffraction(XRD).This method has been validated by the analysis of an XRD experiment conducted on iron single crystals.Furthermore,the method was used to calculate the compression ratio and rotated angle of an LiF sample under high pressure loading.This technique provides a robust tool for in-situ characterization of structural changes in single crystals under extreme conditions.It has significant implications for studying the equation of state and phase transitions.
基金Supported by the National Natural Science Foundation of China(12061048)NSF of Jiangxi Province(20232BAB201026,20232BAB201018)。
文摘In this paper,a new technique is introduced to construct higher-order iterative methods for solving nonlinear systems.The order of convergence of some iterative methods can be improved by three at the cost of introducing only one additional evaluation of the function in each step.Furthermore,some new efficient methods with a higher-order of convergence are obtained by using only a single matrix inversion in each iteration.Analyses of convergence properties and computational efficiency of these new methods are made and testified by several numerical problems.By comparison,the new schemes are more efficient than the corresponding existing ones,particularly for large problem sizes.
