It is well recognized the convenience of converting the linearly constrained convex optimization problems to a monotone variational inequality.Recently,we have proposed a unified algorithmic framework which can guide ...It is well recognized the convenience of converting the linearly constrained convex optimization problems to a monotone variational inequality.Recently,we have proposed a unified algorithmic framework which can guide us to construct the solution methods for solving these monotone variational inequalities.In this work,we revisit two full Jacobian decomposition of the augmented Lagrangian methods for separable convex programming which we have studied a few years ago.In particular,exploiting this framework,we are able to give a very clear and elementary proof of the convergence of these solution methods.展开更多
This paper deals with a bi-extrapolated subgradient projection algorithm by intro- ducing two extrapolated factors in the iterative step to solve the multiple-sets split feasibility problem. The strategy is intend to ...This paper deals with a bi-extrapolated subgradient projection algorithm by intro- ducing two extrapolated factors in the iterative step to solve the multiple-sets split feasibility problem. The strategy is intend to improve the convergence. And its convergence is proved un- der some suitable conditions. Numerical results illustrate that the bi-extrapolated subgradient projection algorithm converges more quickly than the existing algorithms.展开更多
In this paper, we propose two hybrid inertial CQ projection algorithms with linesearch process for the split feasibility problem. Based on the hybrid CQ projection algorithm, we firstly add the inertial term into the ...In this paper, we propose two hybrid inertial CQ projection algorithms with linesearch process for the split feasibility problem. Based on the hybrid CQ projection algorithm, we firstly add the inertial term into the iteration to accelerate the convergence of the algorithm, and adopt flexible rules for selecting the stepsize and the shrinking projection region, which makes an optimal stepsize available at each iteration. The shrinking projection region is the intersection of three sets, which are the set C and two hyperplanes. Furthermore, we modify the Armijo-type line-search step in the presented algorithm to get a new algorithm.The algorithms are shown to be convergent under certain mild assumptions. Besides, numerical examples are given to show that the proposed algorithms have better performance than the general CQ algorithm.展开更多
Cloud detection and classification form a basis in weather analysis. Split window algorithm (SWA) is one of the simple and matured algorithms used to detect and classify water and ice clouds in the atmosphere using sa...Cloud detection and classification form a basis in weather analysis. Split window algorithm (SWA) is one of the simple and matured algorithms used to detect and classify water and ice clouds in the atmosphere using satellite data. The recent availability of Himawari-8 data has considerably strengthened the possibility of better cloud classification owing to its enhanced multi-band configuration as well as high temporal resolution. In SWA, cloud classification is attained by considering the spatial distributions of the brightness temperature (BT) and brightness temperature difference (BTD) of thermal infrared bands. In this study, we compare unsupervised classification results of SWA using the band pair of band 13 and 15 (SWA13-15, 10 and 12 μm bands), versus that of band 15 and 16 (SWA15-16, 12 and 13 μm bands) over the Japan area. Different threshold values of BT and BTD are chosen in winter and summer seasons to categorize cloud regions into nine different types. The accuracy of classification is verified by using the cloud-top height information derived from the data of Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO). For this purpose, six different paths of the space-borne lidar are selected in both summer and winter seasons, on the condition that the time span of overpass falls within the time ranges between 01:00 and 05:00 UTC, which corresponds to the local time around noon. The result of verification indicates that the classification based on SWA13-15 can detect more cloud types as compared with that based on SWA15-16 in both summer and winter seasons, though the latter combination is useful for delineating cumulonimbus underneath dense cirrus展开更多
The increased concern over global climate change and lack of long-term sustainability of fossil fuels in the projected future has prompted further research into advanced alternative fuel vehicles to reduce vehicle emi...The increased concern over global climate change and lack of long-term sustainability of fossil fuels in the projected future has prompted further research into advanced alternative fuel vehicles to reduce vehicle emissions and fuel consumption. One of the primary advanced vehicle research areas involves electrification and hybridization of vehicles. As hybrid-electric vehicle technology has advanced, so has the need for more innovative control schemes for hybrid vehicles, including the development and optimization of hybrid powertrain transmission shift schedules. The hybrid shift schedule works in tandem with a cost function-based torque split algorithm that dynamically determines the optimal torque command for the electric motor and engine. The focus of this work is to develop and analyze the benefits and limitations of two different shift schedules for a position-3 (P3) parallel hybrid-electric vehicle. a traditional two-parameter shift schedule that operates as a function of vehicle accelerator position and vehicle speed (state of charge (SOC) independent shift schedule), and a three-parameter shift schedule that also adapts to fluctuations in the state of charge of the high voltage batteries (SOC dependent shift schedule). The shift schedules were generated using an exhaustive search coupled with a fitness function to evaluate all possible vehicle operating points. The generated shift schedules were then tested in the software-in-the-loop (SIL) environment and the vehicle-in-the-loop (VIL) environment and compared to each other, as well as to the stock 8L45 8-speed transmission shift schedule. The results show that both generated shift schedules improved upon the stock transmission shift schedule used in the hybrid powertrain comparing component efficiency, vehicle efficiency, engine fuel economy, and vehicle fuel economy.展开更多
In this paper,we propose a new analysis framework to study the linear convergence of relaxed operator splitting methods,which can be viewed as an extension of the classic Krasnosel'skii-Mann iteration and Banach-P...In this paper,we propose a new analysis framework to study the linear convergence of relaxed operator splitting methods,which can be viewed as an extension of the classic Krasnosel'skii-Mann iteration and Banach-Picard contraction.As applications,we derive the linear convergence of the generalized proximal point algorithm and the relaxed forward-backward splitting method in a simple and elegant way.展开更多
The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper...The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper, we present new iterative algorithms for solving the split common fixed point problem of demimetric mappings in Hilbert spaces. Moreover, our algorithm does not need any prior information of the operator norm. Weak and strong convergence theorems are given under some mild assumptions. The results in this paper are the extension and improvement of the recent results in the literature.展开更多
In this paper,we make use of the boosting method to introduce a new learning algorithm for Gaussian Mixture Models (GMMs) called adapted Boosted Mixture Learning (BML). The method possesses the ability to rectify the ...In this paper,we make use of the boosting method to introduce a new learning algorithm for Gaussian Mixture Models (GMMs) called adapted Boosted Mixture Learning (BML). The method possesses the ability to rectify the existing problems in other conventional techniques for estimating the GMM parameters, due in part to a new mixing-up strategy to increase the number of Gaussian components. The discriminative splitting idea is employed for Gaussian mixture densities followed by learning via the introduced method. Then, the GMM classifier was applied to distinguish between healthy infants and those that present a selected set of medical conditions. Each group includes both full-term and premature infants. Cry-pattern for each pathological condition is created by using the adapted BML method and 13-dimensional Mel-Frequency Cepstral Coefficients (MFCCs) feature vector. The test results demonstrate that the introduced method for training GMMs has a better performance than the traditional method based upon random splitting and EM-based re-estimation as a reference system in multi-pathological classification task.展开更多
Unmanned Aerial Vehicle(UAV)has emerged as a promising technology for the support of human activities,such as target tracking,disaster rescue,and surveillance.However,these tasks require a large computation load of im...Unmanned Aerial Vehicle(UAV)has emerged as a promising technology for the support of human activities,such as target tracking,disaster rescue,and surveillance.However,these tasks require a large computation load of image or video processing,which imposes enormous pressure on the UAV computation platform.To solve this issue,in this work,we propose an intelligent Task Offloading Algorithm(iTOA)for UAV edge computing network.Compared with existing methods,iTOA is able to perceive the network’s environment intelligently to decide the offloading action based on deep Monte Calor Tree Search(MCTS),the core algorithm of Alpha Go.MCTS will simulate the offloading decision trajectories to acquire the best decision by maximizing the reward,such as lowest latency or power consumption.To accelerate the search convergence of MCTS,we also proposed a splitting Deep Neural Network(sDNN)to supply the prior probability for MCTS.The sDNN is trained by a self-supervised learning manager.Here,the training data set is obtained from iTOA itself as its own teacher.Compared with game theory and greedy search-based methods,the proposed iTOA improves service latency performance by 33%and 60%,respectively.展开更多
An improved fruit fly optimization algorithm( iFOA) is proposed for solving the lot-streaming flow-shop scheduling problem( LSFSP) with equal-size sub-lots. In the proposed iFOA,a solution is encoded as two vectors to...An improved fruit fly optimization algorithm( iFOA) is proposed for solving the lot-streaming flow-shop scheduling problem( LSFSP) with equal-size sub-lots. In the proposed iFOA,a solution is encoded as two vectors to determine the splitting of jobs and the sequence of the sub-lots simultaneously. Based on the encoding scheme,three kinds of neighborhoods are developed for generating new solutions. To well balance the exploitation and exploration,two main search procedures are designed within the evolutionary search framework of the iFOA,including the neighborhood-based search( smell-vision-based search) and the global cooperation-based search. Finally,numerical testing results are provided,and the comparisons demonstrate the effectiveness of the proposed iFOA for solving the LSFSP.展开更多
Douglas-Rachford splitting(DRS)and the alternating direction method of multipliers(ADMM)are two fundamental first-order methods for structured convex optimization.Although derived from different viewpoints,ADMM can be...Douglas-Rachford splitting(DRS)and the alternating direction method of multipliers(ADMM)are two fundamental first-order methods for structured convex optimization.Although derived from different viewpoints,ADMM can be interpreted as the application of DRS to the dual problem.Based on this structural equivalence,this paper studies how algorithmic improvement strategies can be transferred between the two methods.We classify transferable strategies into three categories:exact operator-level transfer,parameterdriven transfer,and heuristic transfer.Representative examples including relaxation,metric scaling,adaptive parameter updates,and residual balancing are discussed to illustrate the different levels of transferability.This perspective provides a systematic way to understand the relationship between DRS and ADMM and clarifies how algorithmic ideas developed for one method may inform the design of variants of the other,offering a unified framework that both explains existing variants and guides the design of new ones.展开更多
Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem(SECFP) in the infinite-dimensional Hilbert spaces introduced by Moudaf...Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem(SECFP) in the infinite-dimensional Hilbert spaces introduced by Moudafi(Alternating CQ-algorithm for convex feasibility and split fixed-point problems. Journal of Nonlinear and Convex Analysis)is to find x ∈ F(U), y ∈ F(T) such that Ax = By,(1)where U : H;→ H;and T : H;→ H;are two nonlinear operators with nonempty fixed point sets F(U) = {x ∈ H;: Ux = x} and F(T) = {x ∈ H;: Tx = x}. Note that,by taking B = I and H;= H;in(1), we recover the split fixed point problem originally introduced in Censor and Segal. Recently, Moudafi introduced alternating CQ-algorithms and simultaneous iterative algorithms with weak convergence for the SECFP(1) of firmly quasi-nonexpansive operators. In this paper, we introduce two viscosity iterative algorithms for the SECFP(1) governed by the general class of quasi-nonexpansive operators. We prove the strong convergence of algorithms. Our results improve and extend previously discussed related problems and algorithms.展开更多
基金The author was supported by the NSFC Grant No.11871029.
摘要It is well recognized the convenience of converting the linearly constrained convex optimization problems to a monotone variational inequality.Recently,we have proposed a unified algorithmic framework which can guide us to construct the solution methods for solving these monotone variational inequalities.In this work,we revisit two full Jacobian decomposition of the augmented Lagrangian methods for separable convex programming which we have studied a few years ago.In particular,exploiting this framework,we are able to give a very clear and elementary proof of the convergence of these solution methods.
基金Supported by Natural Science Foundation of Shanghai(14ZR1429200)National Science Foundation of China(11171221)+4 种基金Shanghai Leading Academic Discipline Project(XTKX2012)Innovation Program of Shanghai Municipal Education Commission(14YZ094)Doctoral Program Foundation of Institutions of Higher Educationof China(20123120110004)Doctoral Starting Projection of the University of Shanghai for Science and Technology(ID-10-303-002)Young Teacher Training Projection Program of Shanghai for Science and Technology
摘要This paper deals with a bi-extrapolated subgradient projection algorithm by intro- ducing two extrapolated factors in the iterative step to solve the multiple-sets split feasibility problem. The strategy is intend to improve the convergence. And its convergence is proved un- der some suitable conditions. Numerical results illustrate that the bi-extrapolated subgradient projection algorithm converges more quickly than the existing algorithms.
基金Supported by the National Natural Science Foundation of China(72071130)。
摘要In this paper, we propose two hybrid inertial CQ projection algorithms with linesearch process for the split feasibility problem. Based on the hybrid CQ projection algorithm, we firstly add the inertial term into the iteration to accelerate the convergence of the algorithm, and adopt flexible rules for selecting the stepsize and the shrinking projection region, which makes an optimal stepsize available at each iteration. The shrinking projection region is the intersection of three sets, which are the set C and two hyperplanes. Furthermore, we modify the Armijo-type line-search step in the presented algorithm to get a new algorithm.The algorithms are shown to be convergent under certain mild assumptions. Besides, numerical examples are given to show that the proposed algorithms have better performance than the general CQ algorithm.
摘要Cloud detection and classification form a basis in weather analysis. Split window algorithm (SWA) is one of the simple and matured algorithms used to detect and classify water and ice clouds in the atmosphere using satellite data. The recent availability of Himawari-8 data has considerably strengthened the possibility of better cloud classification owing to its enhanced multi-band configuration as well as high temporal resolution. In SWA, cloud classification is attained by considering the spatial distributions of the brightness temperature (BT) and brightness temperature difference (BTD) of thermal infrared bands. In this study, we compare unsupervised classification results of SWA using the band pair of band 13 and 15 (SWA13-15, 10 and 12 μm bands), versus that of band 15 and 16 (SWA15-16, 12 and 13 μm bands) over the Japan area. Different threshold values of BT and BTD are chosen in winter and summer seasons to categorize cloud regions into nine different types. The accuracy of classification is verified by using the cloud-top height information derived from the data of Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO). For this purpose, six different paths of the space-borne lidar are selected in both summer and winter seasons, on the condition that the time span of overpass falls within the time ranges between 01:00 and 05:00 UTC, which corresponds to the local time around noon. The result of verification indicates that the classification based on SWA13-15 can detect more cloud types as compared with that based on SWA15-16 in both summer and winter seasons, though the latter combination is useful for delineating cumulonimbus underneath dense cirrus
摘要The increased concern over global climate change and lack of long-term sustainability of fossil fuels in the projected future has prompted further research into advanced alternative fuel vehicles to reduce vehicle emissions and fuel consumption. One of the primary advanced vehicle research areas involves electrification and hybridization of vehicles. As hybrid-electric vehicle technology has advanced, so has the need for more innovative control schemes for hybrid vehicles, including the development and optimization of hybrid powertrain transmission shift schedules. The hybrid shift schedule works in tandem with a cost function-based torque split algorithm that dynamically determines the optimal torque command for the electric motor and engine. The focus of this work is to develop and analyze the benefits and limitations of two different shift schedules for a position-3 (P3) parallel hybrid-electric vehicle. a traditional two-parameter shift schedule that operates as a function of vehicle accelerator position and vehicle speed (state of charge (SOC) independent shift schedule), and a three-parameter shift schedule that also adapts to fluctuations in the state of charge of the high voltage batteries (SOC dependent shift schedule). The shift schedules were generated using an exhaustive search coupled with a fitness function to evaluate all possible vehicle operating points. The generated shift schedules were then tested in the software-in-the-loop (SIL) environment and the vehicle-in-the-loop (VIL) environment and compared to each other, as well as to the stock 8L45 8-speed transmission shift schedule. The results show that both generated shift schedules improved upon the stock transmission shift schedule used in the hybrid powertrain comparing component efficiency, vehicle efficiency, engine fuel economy, and vehicle fuel economy.
基金Supported by the National Natural Science Foundation of China(Grant Nos.1180145511871059+4 种基金11971238)China Postdoctoral Science Foundation(Grant Nos.2019M6634592020T130081)the Applied Basic Project of Sichuan Province(Grant No.2020YJ0111)the Open Project of Key Laboratory of School of Mathematical Sciences,Chongqing Normal University(Grant No.CSSXKFKTM202004)。
摘要In this paper,we propose a new analysis framework to study the linear convergence of relaxed operator splitting methods,which can be viewed as an extension of the classic Krasnosel'skii-Mann iteration and Banach-Picard contraction.As applications,we derive the linear convergence of the generalized proximal point algorithm and the relaxed forward-backward splitting method in a simple and elegant way.
摘要The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper, we present new iterative algorithms for solving the split common fixed point problem of demimetric mappings in Hilbert spaces. Moreover, our algorithm does not need any prior information of the operator norm. Weak and strong convergence theorems are given under some mild assumptions. The results in this paper are the extension and improvement of the recent results in the literature.
摘要In this paper,we make use of the boosting method to introduce a new learning algorithm for Gaussian Mixture Models (GMMs) called adapted Boosted Mixture Learning (BML). The method possesses the ability to rectify the existing problems in other conventional techniques for estimating the GMM parameters, due in part to a new mixing-up strategy to increase the number of Gaussian components. The discriminative splitting idea is employed for Gaussian mixture densities followed by learning via the introduced method. Then, the GMM classifier was applied to distinguish between healthy infants and those that present a selected set of medical conditions. Each group includes both full-term and premature infants. Cry-pattern for each pathological condition is created by using the adapted BML method and 13-dimensional Mel-Frequency Cepstral Coefficients (MFCCs) feature vector. The test results demonstrate that the introduced method for training GMMs has a better performance than the traditional method based upon random splitting and EM-based re-estimation as a reference system in multi-pathological classification task.
基金the Artificial Intelligence Key Laboratory of Sichuan Province(Nos.2019RYJ05)National Natural Science Foundation of China(Nos.61971107).
摘要Unmanned Aerial Vehicle(UAV)has emerged as a promising technology for the support of human activities,such as target tracking,disaster rescue,and surveillance.However,these tasks require a large computation load of image or video processing,which imposes enormous pressure on the UAV computation platform.To solve this issue,in this work,we propose an intelligent Task Offloading Algorithm(iTOA)for UAV edge computing network.Compared with existing methods,iTOA is able to perceive the network’s environment intelligently to decide the offloading action based on deep Monte Calor Tree Search(MCTS),the core algorithm of Alpha Go.MCTS will simulate the offloading decision trajectories to acquire the best decision by maximizing the reward,such as lowest latency or power consumption.To accelerate the search convergence of MCTS,we also proposed a splitting Deep Neural Network(sDNN)to supply the prior probability for MCTS.The sDNN is trained by a self-supervised learning manager.Here,the training data set is obtained from iTOA itself as its own teacher.Compared with game theory and greedy search-based methods,the proposed iTOA improves service latency performance by 33%and 60%,respectively.
基金National Key Basic Research and Development Program of China(No.2013CB329503)National Natural Science Foundation of China(No.61174189)the Doctoral Program Foundation of Institutions of Higher Education of China(No.20130002110057)
摘要An improved fruit fly optimization algorithm( iFOA) is proposed for solving the lot-streaming flow-shop scheduling problem( LSFSP) with equal-size sub-lots. In the proposed iFOA,a solution is encoded as two vectors to determine the splitting of jobs and the sequence of the sub-lots simultaneously. Based on the encoding scheme,three kinds of neighborhoods are developed for generating new solutions. To well balance the exploitation and exploration,two main search procedures are designed within the evolutionary search framework of the iFOA,including the neighborhood-based search( smell-vision-based search) and the global cooperation-based search. Finally,numerical testing results are provided,and the comparisons demonstrate the effectiveness of the proposed iFOA for solving the LSFSP.
摘要Douglas-Rachford splitting(DRS)and the alternating direction method of multipliers(ADMM)are two fundamental first-order methods for structured convex optimization.Although derived from different viewpoints,ADMM can be interpreted as the application of DRS to the dual problem.Based on this structural equivalence,this paper studies how algorithmic improvement strategies can be transferred between the two methods.We classify transferable strategies into three categories:exact operator-level transfer,parameterdriven transfer,and heuristic transfer.Representative examples including relaxation,metric scaling,adaptive parameter updates,and residual balancing are discussed to illustrate the different levels of transferability.This perspective provides a systematic way to understand the relationship between DRS and ADMM and clarifies how algorithmic ideas developed for one method may inform the design of variants of the other,offering a unified framework that both explains existing variants and guides the design of new ones.
基金supported by National Natural Science Foundation of China(61503385)Fundamental Research Funds for the Central Universities of China(3122016L002)
摘要Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem(SECFP) in the infinite-dimensional Hilbert spaces introduced by Moudafi(Alternating CQ-algorithm for convex feasibility and split fixed-point problems. Journal of Nonlinear and Convex Analysis)is to find x ∈ F(U), y ∈ F(T) such that Ax = By,(1)where U : H;→ H;and T : H;→ H;are two nonlinear operators with nonempty fixed point sets F(U) = {x ∈ H;: Ux = x} and F(T) = {x ∈ H;: Tx = x}. Note that,by taking B = I and H;= H;in(1), we recover the split fixed point problem originally introduced in Censor and Segal. Recently, Moudafi introduced alternating CQ-algorithms and simultaneous iterative algorithms with weak convergence for the SECFP(1) of firmly quasi-nonexpansive operators. In this paper, we introduce two viscosity iterative algorithms for the SECFP(1) governed by the general class of quasi-nonexpansive operators. We prove the strong convergence of algorithms. Our results improve and extend previously discussed related problems and algorithms.