Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate o...Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate of this method is investigated.展开更多
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 newly-developed element energy projection (EEP) method with optimal super-convergence order for computation of super-convergent results, an improved self-adaptive strategy for one-dimensional finite ele...Based on the newly-developed element energy projection (EEP) method with optimal super-convergence order for computation of super-convergent results, an improved self-adaptive strategy for one-dimensional finite element method (FEM) is proposed. In the strategy, a posteriori errors are estimated by comparing FEM solutions to EEP super-convergent solutions with optimal order of super-convergence, meshes are refined by using the error-averaging method. Quasi-FEM solutions are used to replace the true FEM solutions in the adaptive process. This strategy has been found to be simple, clear, efficient and reliable. For most problems, only one adaptive step is needed to produce the required FEM solutions which pointwise satisfy the user specified error tolerances in the max-norm. Taking the elliptical ordinary differential equation of the second order as the model problem, this paper describes the fundamental idea, implementation strategy and computational algorithm and representative numerical examples are given to show the effectiveness and reliability of the proposed approach.展开更多
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.展开更多
The element energy projection (EEP) method for computation of super- convergent resulting in a one-dimensional finite element method (FEM) is successfully used to self-adaptive FEM analysis of various linear probl...The element energy projection (EEP) method for computation of super- convergent resulting in a one-dimensional finite element method (FEM) is successfully used to self-adaptive FEM analysis of various linear problems, based on which this paper presents a substantial extension of the whole set of technology to nonlinear problems. The main idea behind the technology transfer from linear analysis to nonlinear analysis is to use Newton's method to linearize nonlinear problems into a series of linear problems so that the EEP formulation and the corresponding adaptive strategy can be directly used without the need for specific super-convergence formulation for nonlinear FEM. As a re- sult, a unified and general self-adaptive algorithm for nonlinear FEM analysis is formed. The proposed algorithm is found to be able to produce satisfactory finite element results with accuracy satisfying the user-preset error tolerances by maximum norm anywhere on the mesh. Taking the nonlinear ordinary differential equation (ODE) of second-order as the model problem, this paper describes the related fundamental idea, the imple- mentation strategy, and the computational algorithm. Representative numerical exam- ples are given to show the efficiency, stability, versatility, and reliability of the proposed approach.展开更多
Based on the newly-developed element energy projection (EEP) method for computation of super-convergent results in one-dimensional finite element method (FEM), the task of self-adaptive FEM analysis was converted ...Based on the newly-developed element energy projection (EEP) method for computation of super-convergent results in one-dimensional finite element method (FEM), the task of self-adaptive FEM analysis was converted into the task of adaptive piecewise polynomial interpolation. As a result, a satisfactory FEM mesh can be obtained, and further FEM analysis on this mesh would immediately produce an FEM solution which usually satisfies the user specified error tolerance. Even though the error tolerance was not completely satisfied, one or two steps of further local refinements would be sufficient. This strategy was found to be very simple, rapid, cheap and efficient. Taking the elliptical ordinary differential equation of second order as the model problem, the fundamental idea, implementation strategy and detailed algorithm are described. Representative numerical examples are given to show the effectiveness and reliability of the proposed approach.展开更多
In this paper, we present a modified projection method for the linear feasibility problems (LFP). Compared with the existing methods, the new method adopts a surrogate technique to obtain new iteration instead of th...In this paper, we present a modified projection method for the linear feasibility problems (LFP). Compared with the existing methods, the new method adopts a surrogate technique to obtain new iteration instead of the line search procedure with fixed stepsize. For the new method, we first show its global convergence under the condition that the solution set is nonempty, and then establish its linear convergence rate. Preliminary numerical experiments show that this method has good performance.展开更多
In this paper, we study the p-order cone constraint stochastic variational inequality problem. We first take the sample average approximation method to deal with the expectation and gain an approximation problem, furt...In this paper, we study the p-order cone constraint stochastic variational inequality problem. We first take the sample average approximation method to deal with the expectation and gain an approximation problem, further the rationality is given. When the underlying function is Lipschitz continuous, we acquire a projection and contraction algorithm to solve the approximation problem. In the end, the method is applied to some numerical experiments and the effectiveness of the algorithm is verified.展开更多
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.展开更多
In this paper,we establish a unified framework to study the almost sure global convergence and the expected convergencerates of a class ofmini-batch stochastic(projected)gradient(SG)methods,including two popular types...In this paper,we establish a unified framework to study the almost sure global convergence and the expected convergencerates of a class ofmini-batch stochastic(projected)gradient(SG)methods,including two popular types of SG:stepsize diminished SG and batch size increased SG.We also show that the standard variance uniformly bounded assumption,which is frequently used in the literature to investigate the convergence of SG,is actually not required when the gradient of the objective function is Lipschitz continuous.Finally,we show that our framework can also be used for analyzing the convergence of a mini-batch stochastic extragradient method for stochastic variational inequality.展开更多
This paper studies the consensus control of multiagent systems with binary-valued observations.An algorithm alternating estimation and control is proposed.Each agent estimates the states of its neighbors based on a pr...This paper studies the consensus control of multiagent systems with binary-valued observations.An algorithm alternating estimation and control is proposed.Each agent estimates the states of its neighbors based on a projected empirical measure method for a holding time.Based on the estimates,each agent designs the consensus control with a constant gain at some skipping time.The states of the system are updated by the designed control,and the estimation and control design will be repeated.For the estimation,the projected empirical measure method is proposed for the binary-valued observations.The algorithm can ensure the uniform boundedness of the estimates and the mean square error of the estimation is proved to be at the order of the reciprocal of the holding time(the same order as that in the case of accurate outputs).For the consensus control,a constant gain is designed instead of the stochastic approximation based gain in the existing literature for binary-valued observations.And,there is no need to make modification for control since the uniform boundedness of the estimates ensures the uniform boundedness of the agents’states.Finally,the systems updated by the designed control are proved to achieve consensus and the consensus speed is faster than that in the existing literature.Simulations are given to demonstrate the theoretical results.展开更多
This paper presents a strategy for computation of super-convergent solutions of multi-dimensional problems in the finite element method (FEM) by recursive application of the one-dimensional (1D) element energy pro...This paper presents a strategy for computation of super-convergent solutions of multi-dimensional problems in the finite element method (FEM) by recursive application of the one-dimensional (1D) element energy projection (EEP) technique. The main idea is to conceptually treat multi-dimensional problems as generalized 1D problems, based on which the concepts of generalized 1D FEM and its consequent EEP formulae have been developed in a unified manner. Equipped with these concepts, multi-dimensional problems can be recursively discretized in one dimension at each step, until a fully discretized standard finite element (FE) model is reached. This conceptual dimension-by- dimension (D-by-D) discretization procedure is entirely equivalent to a full FE discretization. As a reverse D-by-D recovery procedure, by using the unified EEP formulae together with proper extraction of the generalized nodal solutions, super-convergent displacements and first derivatives for two-dimensional (2D) and three-dimensional (3D) problems can be obtained over the domain. Numerical examples of 3D Poisson's equation and elasticity problem are given to verify the feasibility and effectiveness of the proposed strategy.展开更多
The newly proposed element energy projection(EEP) method has been applied to the computation of super_convergent nodal stresses of Timoshenko beam elements.General formulas based on element projection theorem were der...The newly proposed element energy projection(EEP) method has been applied to the computation of super_convergent nodal stresses of Timoshenko beam elements.General formulas based on element projection theorem were derived and illustrative numerical examples using two typical elements were given.Both the analysis and examples show that EEP method also works very well for the problems with vector function solutions.The EEP method gives super_convergent nodal stresses,which are well comparable to the nodal displacements in terms of both convergence rate and error magnitude.And in addition,it can overcome the “shear locking” difficulty for stresses even when the displacements are badly affected.This research paves the way for application of the EEP method to general one_dimensional systems of ordinary differential equations.展开更多
A projected subgradient method for solving a class of set-valued mixed variational inequalities (SMVIs) is proposed when the mapping is not necessarily Lipschitz. Under some suitable conditions, it can be proven tha...A projected subgradient method for solving a class of set-valued mixed variational inequalities (SMVIs) is proposed when the mapping is not necessarily Lipschitz. Under some suitable conditions, it can be proven that the sequence generated by the method can strongly converge to the unique solution to the problem in the Hilbert spaces.展开更多
In this paper we improve the two versions of the two-sided projected quasi-Newton method-onewas proposed by Nocedal & Overton in [1] and the other was discussed in our previous paper, byintroducing three different...In this paper we improve the two versions of the two-sided projected quasi-Newton method-onewas proposed by Nocedal & Overton in [1] and the other was discussed in our previous paper, byintroducing three different merit functions to make inexact one-dimensional searches. It is shown that these improved quasi-Newton algorithms have gained global convergence propertywhich is not possessed by the original two algorithms.展开更多
In this work we consider an extension of the classical scalar-valued projected gradient method for multiobjective problems on convex sets.As in Fazzio et al.(Optim Lett 13:1365-1379,2019)a parameter which controls the...In this work we consider an extension of the classical scalar-valued projected gradient method for multiobjective problems on convex sets.As in Fazzio et al.(Optim Lett 13:1365-1379,2019)a parameter which controls the step length is considered and an updating rule based on the spectral gradient method from the scalar case is proposed.In the present paper,we consider an extension of the traditional nonmonotone approach of Grippo et al.(SIAM J Numer Anal 23:707-716,1986)based on the maximum of some previous function values as suggested in Mita et al.(J Glob Optim 75:539-559,2019)for unconstrained multiobjective optimization problems.We prove the accumulation points of sequences generated by the proposed algorithm,if they exist,are stationary points of the original problem.Numerical experiments are reported.展开更多
This paper deals with a class of inertial gradient projection methods for solving a vari-ational inequality problem involving pseudomonotone and non-Lipschitz mappings in Hilbert spaces.The proposed algorithm incorpor...This paper deals with a class of inertial gradient projection methods for solving a vari-ational inequality problem involving pseudomonotone and non-Lipschitz mappings in Hilbert spaces.The proposed algorithm incorporates inertial techniques and the projection and contraction method.The weak convergence is proved without the condition of the Lipschitz continuity of the mappings.Meanwhile,the linear convergence of the algorithm is established under strong pseudomonotonicity and Lipschitz continuity assumptions.The main results obtained in this paper extend and improve some related works in the literature.展开更多
In this paper,a three-term derivative-free projection method is proposed for solving nonlinear monotone equations.Under someappropriate conditions,the global convergence and R-linear convergence rate of the proposed m...In this paper,a three-term derivative-free projection method is proposed for solving nonlinear monotone equations.Under someappropriate conditions,the global convergence and R-linear convergence rate of the proposed method are analyzed and proved.With no need of any derivative information,the proposed method is able to solve large-scale nonlinear monotone equations.Numerical comparisons show that the proposed method is effective.展开更多
文摘Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate of this method is investigated.
基金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.
基金the National Natural Science Foundation of China(No.50678093)Program for Changjiang Scholars and Innovative Research Team in University(No.IRT00736)
文摘Based on the newly-developed element energy projection (EEP) method with optimal super-convergence order for computation of super-convergent results, an improved self-adaptive strategy for one-dimensional finite element method (FEM) is proposed. In the strategy, a posteriori errors are estimated by comparing FEM solutions to EEP super-convergent solutions with optimal order of super-convergence, meshes are refined by using the error-averaging method. Quasi-FEM solutions are used to replace the true FEM solutions in the adaptive process. This strategy has been found to be simple, clear, efficient and reliable. For most problems, only one adaptive step is needed to produce the required FEM solutions which pointwise satisfy the user specified error tolerances in the max-norm. Taking the elliptical ordinary differential equation of the second order as the model problem, this paper describes the fundamental idea, implementation strategy and computational algorithm and representative numerical examples are given to show the effectiveness and reliability of the proposed approach.
文摘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.
基金supported by the National Natural Science Foundation of China(Nos.51378293,51078199,50678093,and 50278046)the Program for Changjiang Scholars and the Innovative Research Team in University of China(No.IRT00736)
文摘The element energy projection (EEP) method for computation of super- convergent resulting in a one-dimensional finite element method (FEM) is successfully used to self-adaptive FEM analysis of various linear problems, based on which this paper presents a substantial extension of the whole set of technology to nonlinear problems. The main idea behind the technology transfer from linear analysis to nonlinear analysis is to use Newton's method to linearize nonlinear problems into a series of linear problems so that the EEP formulation and the corresponding adaptive strategy can be directly used without the need for specific super-convergence formulation for nonlinear FEM. As a re- sult, a unified and general self-adaptive algorithm for nonlinear FEM analysis is formed. The proposed algorithm is found to be able to produce satisfactory finite element results with accuracy satisfying the user-preset error tolerances by maximum norm anywhere on the mesh. Taking the nonlinear ordinary differential equation (ODE) of second-order as the model problem, this paper describes the related fundamental idea, the imple- mentation strategy, and the computational algorithm. Representative numerical exam- ples are given to show the efficiency, stability, versatility, and reliability of the proposed approach.
基金Project supported by the National Natural Science Foundation of China (No.50278046)
文摘Based on the newly-developed element energy projection (EEP) method for computation of super-convergent results in one-dimensional finite element method (FEM), the task of self-adaptive FEM analysis was converted into the task of adaptive piecewise polynomial interpolation. As a result, a satisfactory FEM mesh can be obtained, and further FEM analysis on this mesh would immediately produce an FEM solution which usually satisfies the user specified error tolerance. Even though the error tolerance was not completely satisfied, one or two steps of further local refinements would be sufficient. This strategy was found to be very simple, rapid, cheap and efficient. Taking the elliptical ordinary differential equation of second order as the model problem, the fundamental idea, implementation strategy and detailed algorithm are described. Representative numerical examples are given to show the effectiveness and reliability of the proposed approach.
基金supported by National Natural Science Foundation of China (No. 10771120)Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry
文摘In this paper, we present a modified projection method for the linear feasibility problems (LFP). Compared with the existing methods, the new method adopts a surrogate technique to obtain new iteration instead of the line search procedure with fixed stepsize. For the new method, we first show its global convergence under the condition that the solution set is nonempty, and then establish its linear convergence rate. Preliminary numerical experiments show that this method has good performance.
文摘In this paper, we study the p-order cone constraint stochastic variational inequality problem. We first take the sample average approximation method to deal with the expectation and gain an approximation problem, further the rationality is given. When the underlying function is Lipschitz continuous, we acquire a projection and contraction algorithm to solve the approximation problem. In the end, the method is applied to some numerical experiments and the effectiveness of the algorithm is verified.
文摘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.
基金the National Natural Science Foundation of China(Nos.11871135 and 11801054)the Fundamental Research Funds for the Central Universities(No.DUT19K46)。
文摘In this paper,we establish a unified framework to study the almost sure global convergence and the expected convergencerates of a class ofmini-batch stochastic(projected)gradient(SG)methods,including two popular types of SG:stepsize diminished SG and batch size increased SG.We also show that the standard variance uniformly bounded assumption,which is frequently used in the literature to investigate the convergence of SG,is actually not required when the gradient of the objective function is Lipschitz continuous.Finally,we show that our framework can also be used for analyzing the convergence of a mini-batch stochastic extragradient method for stochastic variational inequality.
基金supported by the National Natural Science Foundation of China(61803370,61622309)the China Postdoctoral Science Foundation(2018M630216)the National Key Research and Development Program of China(2016YFB0901902)
文摘This paper studies the consensus control of multiagent systems with binary-valued observations.An algorithm alternating estimation and control is proposed.Each agent estimates the states of its neighbors based on a projected empirical measure method for a holding time.Based on the estimates,each agent designs the consensus control with a constant gain at some skipping time.The states of the system are updated by the designed control,and the estimation and control design will be repeated.For the estimation,the projected empirical measure method is proposed for the binary-valued observations.The algorithm can ensure the uniform boundedness of the estimates and the mean square error of the estimation is proved to be at the order of the reciprocal of the holding time(the same order as that in the case of accurate outputs).For the consensus control,a constant gain is designed instead of the stochastic approximation based gain in the existing literature for binary-valued observations.And,there is no need to make modification for control since the uniform boundedness of the estimates ensures the uniform boundedness of the agents’states.Finally,the systems updated by the designed control are proved to achieve consensus and the consensus speed is faster than that in the existing literature.Simulations are given to demonstrate the theoretical results.
基金supported by the National Natural Science Foundation of China(Nos.51378293 and 51078199)
文摘This paper presents a strategy for computation of super-convergent solutions of multi-dimensional problems in the finite element method (FEM) by recursive application of the one-dimensional (1D) element energy projection (EEP) technique. The main idea is to conceptually treat multi-dimensional problems as generalized 1D problems, based on which the concepts of generalized 1D FEM and its consequent EEP formulae have been developed in a unified manner. Equipped with these concepts, multi-dimensional problems can be recursively discretized in one dimension at each step, until a fully discretized standard finite element (FE) model is reached. This conceptual dimension-by- dimension (D-by-D) discretization procedure is entirely equivalent to a full FE discretization. As a reverse D-by-D recovery procedure, by using the unified EEP formulae together with proper extraction of the generalized nodal solutions, super-convergent displacements and first derivatives for two-dimensional (2D) and three-dimensional (3D) problems can be obtained over the domain. Numerical examples of 3D Poisson's equation and elasticity problem are given to verify the feasibility and effectiveness of the proposed strategy.
文摘The newly proposed element energy projection(EEP) method has been applied to the computation of super_convergent nodal stresses of Timoshenko beam elements.General formulas based on element projection theorem were derived and illustrative numerical examples using two typical elements were given.Both the analysis and examples show that EEP method also works very well for the problems with vector function solutions.The EEP method gives super_convergent nodal stresses,which are well comparable to the nodal displacements in terms of both convergence rate and error magnitude.And in addition,it can overcome the “shear locking” difficulty for stresses even when the displacements are badly affected.This research paves the way for application of the EEP method to general one_dimensional systems of ordinary differential equations.
基金supported by the Key Program of National Natural Science Foundation of China(No.70831005)the National Natural Science Foundation of China(No.10671135)the Fundamental Research Funds for the Central Universities(No.2009SCU11096)
文摘A projected subgradient method for solving a class of set-valued mixed variational inequalities (SMVIs) is proposed when the mapping is not necessarily Lipschitz. Under some suitable conditions, it can be proven that the sequence generated by the method can strongly converge to the unique solution to the problem in the Hilbert spaces.
基金This research was supported in part by tbe National Natural Science Foundation of China
文摘In this paper we improve the two versions of the two-sided projected quasi-Newton method-onewas proposed by Nocedal & Overton in [1] and the other was discussed in our previous paper, byintroducing three different merit functions to make inexact one-dimensional searches. It is shown that these improved quasi-Newton algorithms have gained global convergence propertywhich is not possessed by the original two algorithms.
基金ANPCyT(Nos.PICT 2016-0921 and PICT 2019-02172),Argentina.
文摘In this work we consider an extension of the classical scalar-valued projected gradient method for multiobjective problems on convex sets.As in Fazzio et al.(Optim Lett 13:1365-1379,2019)a parameter which controls the step length is considered and an updating rule based on the spectral gradient method from the scalar case is proposed.In the present paper,we consider an extension of the traditional nonmonotone approach of Grippo et al.(SIAM J Numer Anal 23:707-716,1986)based on the maximum of some previous function values as suggested in Mita et al.(J Glob Optim 75:539-559,2019)for unconstrained multiobjective optimization problems.We prove the accumulation points of sequences generated by the proposed algorithm,if they exist,are stationary points of the original problem.Numerical experiments are reported.
文摘This paper deals with a class of inertial gradient projection methods for solving a vari-ational inequality problem involving pseudomonotone and non-Lipschitz mappings in Hilbert spaces.The proposed algorithm incorporates inertial techniques and the projection and contraction method.The weak convergence is proved without the condition of the Lipschitz continuity of the mappings.Meanwhile,the linear convergence of the algorithm is established under strong pseudomonotonicity and Lipschitz continuity assumptions.The main results obtained in this paper extend and improve some related works in the literature.
文摘In this paper,a three-term derivative-free projection method is proposed for solving nonlinear monotone equations.Under someappropriate conditions,the global convergence and R-linear convergence rate of the proposed method are analyzed and proved.With no need of any derivative information,the proposed method is able to solve large-scale nonlinear monotone equations.Numerical comparisons show that the proposed method is effective.