A pressure gradient discontinuous finite element formulation for the compressible Navier-Stokes equations is derived based on local projections. The resulting finite element formulation is stable and uniquely solvable...A pressure gradient discontinuous finite element formulation for the compressible Navier-Stokes equations is derived based on local projections. The resulting finite element formulation is stable and uniquely solvable without requiring a B-B stability condition. An error estimate is Obtained.展开更多
In this paper, a class of the stochastic generalized linear complementarity problems with finitely many elements is proposed for the first time. Based on the Fischer-Burmeister function, a new conjugate gradient proje...In this paper, a class of the stochastic generalized linear complementarity problems with finitely many elements is proposed for the first time. Based on the Fischer-Burmeister function, a new conjugate gradient projection method is given for solving the stochastic generalized linear complementarity problems. The global convergence of the conjugate gradient projection method is proved and the related numerical results are also reported.展开更多
In this paper, by using a new projection, we construct a variant of Zhang’s algorithm and prove its convergence. Specially, the variant of Zhang’s algorithm has quadratic termination and superlinear convergence rale...In this paper, by using a new projection, we construct a variant of Zhang’s algorithm and prove its convergence. Specially, the variant of Zhang’s algorithm has quadratic termination and superlinear convergence rale under certain conditions. Zhang’s algorithm hasn’t these properties.展开更多
Based on the numerical governing formulation and non-linear complementary conditions of contact and impact problems, a reduced projection augmented Lagrange bi- conjugate gradient method is proposed for contact and im...Based on the numerical governing formulation and non-linear complementary conditions of contact and impact problems, a reduced projection augmented Lagrange bi- conjugate gradient method is proposed for contact and impact problems by translating non-linear complementary conditions into equivalent formulation of non-linear program- ming. For contact-impact problems, a larger time-step can be adopted arriving at numer- ical convergence compared with penalty method. By establishment of the impact-contact formulations which are equivalent with original non-linear complementary conditions, a reduced projection augmented Lagrange bi-conjugate gradient method is deduced to im- prove precision and efficiency of numerical solutions. A numerical example shows that the algorithm we suggested is valid and exact.展开更多
This paper discusses a special class of mathematical programs with equilibrium constraints. At first, by using a generalized complementarity function, the discussed problem is transformed into a family of general nonl...This paper discusses a special class of mathematical programs with equilibrium constraints. At first, by using a generalized complementarity function, the discussed problem is transformed into a family of general nonlinear optimization problems containing additional variable μ. Furthermore, combining the idea of penalty function, an auxiliary problem with inequality constraints is presented. And then, by providing explicit searching direction, we establish a new conjugate projection gradient method for optimization with nonlinear complementarity constraints. Under some suitable conditions, the proposed method is proved to possess global and superlinear convergence rate.展开更多
In this paper,a probe method for nonlinear programming wiht equality and inequality is given. Its iterative directions at an arbitrary point x can be obtained through solving a liear system. The terminate conditions a...In this paper,a probe method for nonlinear programming wiht equality and inequality is given. Its iterative directions at an arbitrary point x can be obtained through solving a liear system. The terminate conditions and choices of the parameters are given. The global convergence of the method is proved. Further more,some well known gradient projection type algorithms [1-15] and new gradient projection type algorithms from the linear system are given in this paper.展开更多
A subspace projected conjugate gradient method is proposed for solving large bound constrained quadratic programming. The conjugate gradient method is used to update the variables with indices outside of the active se...A subspace projected conjugate gradient method is proposed for solving large bound constrained quadratic programming. The conjugate gradient method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. At every iterative level, the search direction consists of two parts, one of which is a subspace trumcated Newton direction, another is a modified gradient direction. With the projected search the algorithm is suitable to large problems. The convergence of the method is proved and same numerical tests with dimensions ranging from 5000 to 20000 are given.展开更多
Improving numerical forecasting skill in the atmospheric and oceanic sciences by solving optimization problems is an important issue. One such method is to compute the conditional nonlinear optimal perturbation(CNOP),...Improving numerical forecasting skill in the atmospheric and oceanic sciences by solving optimization problems is an important issue. One such method is to compute the conditional nonlinear optimal perturbation(CNOP), which has been applied widely in predictability studies. In this study, the Differential Evolution(DE) algorithm, which is a derivative-free algorithm and has been applied to obtain CNOPs for exploring the uncertainty of terrestrial ecosystem processes, was employed to obtain the CNOPs for finite-dimensional optimization problems with ball constraint conditions using Burgers' equation. The aim was first to test if the CNOP calculated by the DE algorithm is similar to that computed by traditional optimization algorithms, such as the Spectral Projected Gradient(SPG2) algorithm. The second motive was to supply a possible route through which the CNOP approach can be applied in predictability studies in the atmospheric and oceanic sciences without obtaining a model adjoint system, or for optimization problems with non-differentiable cost functions. A projection skill was first explanted to the DE algorithm to calculate the CNOPs. To validate the algorithm, the SPG2 algorithm was also applied to obtain the CNOPs for the same optimization problems. The results showed that the CNOPs obtained by the DE algorithm were nearly the same as those obtained by the SPG2 algorithm in terms of their spatial distributions and nonlinear evolutions. The implication is that the DE algorithm could be employed to calculate the optimal values of optimization problems, especially for non-differentiable and nonlinear optimization problems associated with the atmospheric and oceanic sciences.展开更多
In this paper, a modified Polak-Ribière-Polyak conjugate gradient projection method is proposed for solving large scale nonlinear convex constrained monotone equations based on the projection method of Solodov an...In this paper, a modified Polak-Ribière-Polyak conjugate gradient projection method is proposed for solving large scale nonlinear convex constrained monotone equations based on the projection method of Solodov and Svaiter. The obtained method has low-complexity property and converges globally. Furthermore, this method has also been extended to solve the sparse signal reconstruction in compressive sensing. Numerical experiments illustrate the efficiency of the given method and show that such non-monotone method is suitable for some large scale problems.展开更多
Matrix completion is the extension of compressed sensing.In compressed sensing,we solve the underdetermined equations using sparsity prior of the unknown signals.However,in matrix completion,we solve the underdetermin...Matrix completion is the extension of compressed sensing.In compressed sensing,we solve the underdetermined equations using sparsity prior of the unknown signals.However,in matrix completion,we solve the underdetermined equations based on sparsity prior in singular values set of the unknown matrix,which also calls low-rank prior of the unknown matrix.This paper firstly introduces basic concept of matrix completion,analyses the matrix suitably used in matrix completion,and shows that such matrix should satisfy two conditions:low rank and incoherence property.Then the paper provides three reconstruction algorithms commonly used in matrix completion:singular value thresholding algorithm,singular value projection,and atomic decomposition for minimum rank approximation,puts forward their shortcoming to know the rank of original matrix.The Projected Gradient Descent based on Soft Thresholding(STPGD),proposed in this paper predicts the rank of unknown matrix using soft thresholding,and iteratives based on projected gradient descent,thus it could estimate the rank of unknown matrix exactly with low computational complexity,this is verified by numerical experiments.We also analyze the convergence and computational complexity of the STPGD algorithm,point out this algorithm is guaranteed to converge,and analyse the number of iterations needed to reach reconstruction error.Compared the computational complexity of the STPGD algorithm to other algorithms,we draw the conclusion that the STPGD algorithm not only reduces the computational complexity,but also improves the precision of the reconstruction solution.展开更多
In this paper, a projected gradient trust region algorithm for solving nonlinear equality systems with convex constraints is considered. The global convergence results are developed in a very general setting of comput...In this paper, a projected gradient trust region algorithm for solving nonlinear equality systems with convex constraints is considered. The global convergence results are developed in a very general setting of computing trial directions by this method combining with the line search technique. Close to the solution set this method is locally Q-superlinearly convergent under an error bound assumption which is much weaker than the standard nonsingularity condition.展开更多
Based on a differentiable merit function proposed by Taji, et al in “Mathematical Programming, 1993, 58: 369-383”, a projected gradient trust region method for the monotone variational inequality problem with conve...Based on a differentiable merit function proposed by Taji, et al in “Mathematical Programming, 1993, 58: 369-383”, a projected gradient trust region method for the monotone variational inequality problem with convex constraints is presented. Theoretical analysis is given which proves that the proposed algorithm is globally convergent and has a local quadratic convergence rate under some reasonable conditions. The results of numerical experiments are reported to show the effectiveness of the proposed algorithm.展开更多
In this paper, we proposed a spectral gradient-Newton two phase method for constrained semismooth equations. In the first stage, we use the spectral projected gradient to obtain the global convergence of the algorithm...In this paper, we proposed a spectral gradient-Newton two phase method for constrained semismooth equations. In the first stage, we use the spectral projected gradient to obtain the global convergence of the algorithm, and then use the final point in the first stage as a new initial point to turn to a projected semismooth asymptotically newton method for fast convergence.展开更多
Driven by the increase in CO_(2)concentration,climate models reach a consensus that the large-scale circulation of the South Asian summer monsoon(SASM) becomes weakened but with different magnitudes.This study investi...Driven by the increase in CO_(2)concentration,climate models reach a consensus that the large-scale circulation of the South Asian summer monsoon(SASM) becomes weakened but with different magnitudes.This study investigates the major uncertainty sources of the SASM response to an abrupt quadrupling of CO_(2)(abrupt-4×CO_(2))in 18 models of phase 6 of the Coupled Model Intercomparison Project.The projected weakening of the SASM indicated by both zonal and meridional monsoon circulation indices is closely linked to decreases in the meridional gradient of upper-tropospheric temperature between Eurasia and the Indian Ocean(EUTT-IUTT).A climate feedback-response analysis method is applied to linearly decompose the uncertainty of changes in EUTT-IUTT into the partial changes due to external forcing and internal processes of the earth-atmosphere column.Results show that the uncertainty of changes in EUTT-IUTT is contributed positively by the dominant atmospheric dynamic process,followed by the cloud shortwave radiative effect,and negatively by the surface latent heat flux and cloud longwave radiative effect.Contributions from CO_(2)forcing and other internal processes including albedo and water vapor feedbacks,oceanic heat storage,and sensible heat flux are found to be minor.展开更多
This paper is concerned with distributed Nash equi librium seeking strategies under quantized communication. In the proposed seeking strategy, a projection operator is synthesized with a gradient search method to achi...This paper is concerned with distributed Nash equi librium seeking strategies under quantized communication. In the proposed seeking strategy, a projection operator is synthesized with a gradient search method to achieve the optimization o players' objective functions while restricting their actions within required non-empty, convex and compact domains. In addition, a leader-following consensus protocol, in which quantized informa tion flows are utilized, is employed for information sharing among players. More specifically, logarithmic quantizers and uniform quantizers are investigated under both undirected and connected communication graphs and strongly connected digraphs, respec tively. Through Lyapunov stability analysis, it is shown that play ers' actions can be steered to a neighborhood of the Nash equilib rium with logarithmic and uniform quantizers, and the quanti fied convergence error depends on the parameter of the quan tizer for both undirected and directed cases. A numerical exam ple is given to verify the theoretical results.展开更多
针对天基信息支援体系效能评估中存在的主观性强与复杂性高的问题,提出一种基于投影梯度神经网络的天基信息支援体系效能评估方法。首先,基于国防部体系框架(Department of Defense Architecture Framework,DoDAF)视图产品与包以德循环(...针对天基信息支援体系效能评估中存在的主观性强与复杂性高的问题,提出一种基于投影梯度神经网络的天基信息支援体系效能评估方法。首先,基于国防部体系框架(Department of Defense Architecture Framework,DoDAF)视图产品与包以德循环(observation,orientation,decision,action,OODA)梳理体系作战流程,进而建立评估指标体系,并基于离散事件仿真生成效能评估数据样本。然后,基于Rosen-反向传播(back propagation,BP)神经网络构建效能评估代理模型,并通过对权重参数的限制来解决在效益型指标下评估模型难以解释的问题。最后,对仿真样本进行评估模型验证试验,结果表明所提方法在天基信息支援体系效能评估中相较于传统BP神经网络计算性能提升超过50%,能够为天基信息支援体系效能评估提供技术支撑。展开更多
基于检索1950-2016年发表在中国知网、Google Scholar、Web of Science等数据库的文章,筛选出关于我国退耕还草工程与土壤有机碳的文献123篇(126个研究地点)。基于筛选文献,提取了农田和恢复草地的土壤有机碳含量、土壤有效养分含量、...基于检索1950-2016年发表在中国知网、Google Scholar、Web of Science等数据库的文章,筛选出关于我国退耕还草工程与土壤有机碳的文献123篇(126个研究地点)。基于筛选文献,提取了农田和恢复草地的土壤有机碳含量、土壤有效养分含量、恢复时间和气候等数据735条,旨在探究我国退耕还草工程对土壤有机碳含量的影响及其主导因素。结果表明:1)农田恢复为草地后,土壤有机碳含量呈先下降后上升趋势(时间拐点约为第6年),整体上退耕还草工程使土壤有机碳含量提高了19.8%。2)土壤有机碳的正响应随土壤深度增加而减弱,且深度超过1 m时其正响应不明显。3)土壤有效氮是影响土壤有机碳恢复的主要因素,而土壤有效磷和植物功能群对其影响不大。4)沿着增加的水分梯度,土壤有机碳的恢复效果由负变正,转变阈值为25.15 (干旱指数)。总体而言,我国退耕还草工程对土壤有机碳含量的影响为正效应,此效应受环境梯度和恢复时间的共同影响。本研究能够为我国土地利用变化背景下土壤碳库管理的相关决策提供科学依据。展开更多
基金Project supported by the Science and Technology Foundation of Sichuan Province (No.05GG006- 006-2)the Research Fund for the Introducing Intelligence of University of Electronic Science and Technology of China
文摘A pressure gradient discontinuous finite element formulation for the compressible Navier-Stokes equations is derived based on local projections. The resulting finite element formulation is stable and uniquely solvable without requiring a B-B stability condition. An error estimate is Obtained.
文摘In this paper, a class of the stochastic generalized linear complementarity problems with finitely many elements is proposed for the first time. Based on the Fischer-Burmeister function, a new conjugate gradient projection method is given for solving the stochastic generalized linear complementarity problems. The global convergence of the conjugate gradient projection method is proved and the related numerical results are also reported.
基金The subject is supported by Natural Science Foundation of China and Natural Science Foundation of Shandong Province.
文摘In this paper, by using a new projection, we construct a variant of Zhang’s algorithm and prove its convergence. Specially, the variant of Zhang’s algorithm has quadratic termination and superlinear convergence rale under certain conditions. Zhang’s algorithm hasn’t these properties.
文摘Based on the numerical governing formulation and non-linear complementary conditions of contact and impact problems, a reduced projection augmented Lagrange bi- conjugate gradient method is proposed for contact and impact problems by translating non-linear complementary conditions into equivalent formulation of non-linear program- ming. For contact-impact problems, a larger time-step can be adopted arriving at numer- ical convergence compared with penalty method. By establishment of the impact-contact formulations which are equivalent with original non-linear complementary conditions, a reduced projection augmented Lagrange bi-conjugate gradient method is deduced to im- prove precision and efficiency of numerical solutions. A numerical example shows that the algorithm we suggested is valid and exact.
文摘This paper discusses a special class of mathematical programs with equilibrium constraints. At first, by using a generalized complementarity function, the discussed problem is transformed into a family of general nonlinear optimization problems containing additional variable μ. Furthermore, combining the idea of penalty function, an auxiliary problem with inequality constraints is presented. And then, by providing explicit searching direction, we establish a new conjugate projection gradient method for optimization with nonlinear complementarity constraints. Under some suitable conditions, the proposed method is proved to possess global and superlinear convergence rate.
文摘In this paper,a probe method for nonlinear programming wiht equality and inequality is given. Its iterative directions at an arbitrary point x can be obtained through solving a liear system. The terminate conditions and choices of the parameters are given. The global convergence of the method is proved. Further more,some well known gradient projection type algorithms [1-15] and new gradient projection type algorithms from the linear system are given in this paper.
基金This research was supported by Chinese NNSF grant and NSF grant of Jiangsu Province
文摘A subspace projected conjugate gradient method is proposed for solving large bound constrained quadratic programming. The conjugate gradient method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. At every iterative level, the search direction consists of two parts, one of which is a subspace trumcated Newton direction, another is a modified gradient direction. With the projected search the algorithm is suitable to large problems. The convergence of the method is proved and same numerical tests with dimensions ranging from 5000 to 20000 are given.
基金provided by grants from the LASG State Key Laboratory Special Fundthe National Natural Science Foundation of China (Grant Nos. 40905050, 40830955, and 41375111)
文摘Improving numerical forecasting skill in the atmospheric and oceanic sciences by solving optimization problems is an important issue. One such method is to compute the conditional nonlinear optimal perturbation(CNOP), which has been applied widely in predictability studies. In this study, the Differential Evolution(DE) algorithm, which is a derivative-free algorithm and has been applied to obtain CNOPs for exploring the uncertainty of terrestrial ecosystem processes, was employed to obtain the CNOPs for finite-dimensional optimization problems with ball constraint conditions using Burgers' equation. The aim was first to test if the CNOP calculated by the DE algorithm is similar to that computed by traditional optimization algorithms, such as the Spectral Projected Gradient(SPG2) algorithm. The second motive was to supply a possible route through which the CNOP approach can be applied in predictability studies in the atmospheric and oceanic sciences without obtaining a model adjoint system, or for optimization problems with non-differentiable cost functions. A projection skill was first explanted to the DE algorithm to calculate the CNOPs. To validate the algorithm, the SPG2 algorithm was also applied to obtain the CNOPs for the same optimization problems. The results showed that the CNOPs obtained by the DE algorithm were nearly the same as those obtained by the SPG2 algorithm in terms of their spatial distributions and nonlinear evolutions. The implication is that the DE algorithm could be employed to calculate the optimal values of optimization problems, especially for non-differentiable and nonlinear optimization problems associated with the atmospheric and oceanic sciences.
文摘In this paper, a modified Polak-Ribière-Polyak conjugate gradient projection method is proposed for solving large scale nonlinear convex constrained monotone equations based on the projection method of Solodov and Svaiter. The obtained method has low-complexity property and converges globally. Furthermore, this method has also been extended to solve the sparse signal reconstruction in compressive sensing. Numerical experiments illustrate the efficiency of the given method and show that such non-monotone method is suitable for some large scale problems.
基金Supported by the National Natural Science Foundation ofChina(No.61271240)Jiangsu Province Natural Science Fund Project(No.BK2010077)Subject of Twelfth Five Years Plans in Jiangsu Second Normal University(No.417103)
文摘Matrix completion is the extension of compressed sensing.In compressed sensing,we solve the underdetermined equations using sparsity prior of the unknown signals.However,in matrix completion,we solve the underdetermined equations based on sparsity prior in singular values set of the unknown matrix,which also calls low-rank prior of the unknown matrix.This paper firstly introduces basic concept of matrix completion,analyses the matrix suitably used in matrix completion,and shows that such matrix should satisfy two conditions:low rank and incoherence property.Then the paper provides three reconstruction algorithms commonly used in matrix completion:singular value thresholding algorithm,singular value projection,and atomic decomposition for minimum rank approximation,puts forward their shortcoming to know the rank of original matrix.The Projected Gradient Descent based on Soft Thresholding(STPGD),proposed in this paper predicts the rank of unknown matrix using soft thresholding,and iteratives based on projected gradient descent,thus it could estimate the rank of unknown matrix exactly with low computational complexity,this is verified by numerical experiments.We also analyze the convergence and computational complexity of the STPGD algorithm,point out this algorithm is guaranteed to converge,and analyse the number of iterations needed to reach reconstruction error.Compared the computational complexity of the STPGD algorithm to other algorithms,we draw the conclusion that the STPGD algorithm not only reduces the computational complexity,but also improves the precision of the reconstruction solution.
基金Supported by the National Natural Science Foundation of China (10871130)the Research Fund for the Doctoral Program of Higher Education of China (20093127110005)the Scientific Computing Key Laboratory of Shanghai Universities
文摘In this paper, a projected gradient trust region algorithm for solving nonlinear equality systems with convex constraints is considered. The global convergence results are developed in a very general setting of computing trial directions by this method combining with the line search technique. Close to the solution set this method is locally Q-superlinearly convergent under an error bound assumption which is much weaker than the standard nonsingularity condition.
基金Supported by the National Natural Science Foundation of China (10871130)the Ph.D.Foundation of China Education Ministry (0527003)+1 种基金Shanghai Educational Development Foundationthe Science Foundation of Shanghai Education Committee(06A110)
文摘Based on a differentiable merit function proposed by Taji, et al in “Mathematical Programming, 1993, 58: 369-383”, a projected gradient trust region method for the monotone variational inequality problem with convex constraints is presented. Theoretical analysis is given which proves that the proposed algorithm is globally convergent and has a local quadratic convergence rate under some reasonable conditions. The results of numerical experiments are reported to show the effectiveness of the proposed algorithm.
文摘In this paper, we proposed a spectral gradient-Newton two phase method for constrained semismooth equations. In the first stage, we use the spectral projected gradient to obtain the global convergence of the algorithm, and then use the final point in the first stage as a new initial point to turn to a projected semismooth asymptotically newton method for fast convergence.
基金jointly supported by the National Natural Science Foundation of China [grant numbers 4208810141911540470+3 种基金42075028]the Guangdong Major Project of Basic and Applied Basic Research [grant number 2020B0301030004]the Natural Science Foundation of Guangdong Province of China [grant number 2018A0303130268]the Guangdong Province Key Laboratory for Climate Change and Natural Disaster Studies [grant number2020B1212060025]。
文摘Driven by the increase in CO_(2)concentration,climate models reach a consensus that the large-scale circulation of the South Asian summer monsoon(SASM) becomes weakened but with different magnitudes.This study investigates the major uncertainty sources of the SASM response to an abrupt quadrupling of CO_(2)(abrupt-4×CO_(2))in 18 models of phase 6 of the Coupled Model Intercomparison Project.The projected weakening of the SASM indicated by both zonal and meridional monsoon circulation indices is closely linked to decreases in the meridional gradient of upper-tropospheric temperature between Eurasia and the Indian Ocean(EUTT-IUTT).A climate feedback-response analysis method is applied to linearly decompose the uncertainty of changes in EUTT-IUTT into the partial changes due to external forcing and internal processes of the earth-atmosphere column.Results show that the uncertainty of changes in EUTT-IUTT is contributed positively by the dominant atmospheric dynamic process,followed by the cloud shortwave radiative effect,and negatively by the surface latent heat flux and cloud longwave radiative effect.Contributions from CO_(2)forcing and other internal processes including albedo and water vapor feedbacks,oceanic heat storage,and sensible heat flux are found to be minor.
基金supported by the National Natural Science Foundation of China (NSFC)(62222308, 62173181, 62073171, 62221004)the Natural Science Foundation of Jiangsu Province (BK20200744, BK20220139)+3 种基金Jiangsu Specially-Appointed Professor (RK043STP19001)the Young Elite Scientists Sponsorship Program by CAST (2021QNRC001)1311 Talent Plan of Nanjing University of Posts and Telecommunicationsthe Fundamental Research Funds for the Central Universities (30920032203)。
文摘This paper is concerned with distributed Nash equi librium seeking strategies under quantized communication. In the proposed seeking strategy, a projection operator is synthesized with a gradient search method to achieve the optimization o players' objective functions while restricting their actions within required non-empty, convex and compact domains. In addition, a leader-following consensus protocol, in which quantized informa tion flows are utilized, is employed for information sharing among players. More specifically, logarithmic quantizers and uniform quantizers are investigated under both undirected and connected communication graphs and strongly connected digraphs, respec tively. Through Lyapunov stability analysis, it is shown that play ers' actions can be steered to a neighborhood of the Nash equilib rium with logarithmic and uniform quantizers, and the quanti fied convergence error depends on the parameter of the quan tizer for both undirected and directed cases. A numerical exam ple is given to verify the theoretical results.