Angle rigid multi-agent formations can simultaneously undergo translational,rotational,and scaling maneuvering,therefore combining the maneuvering capabilities of both distance and bearing rigid formations.However,man...Angle rigid multi-agent formations can simultaneously undergo translational,rotational,and scaling maneuvering,therefore combining the maneuvering capabilities of both distance and bearing rigid formations.However,maneuvering angle rigid formations in 2D or 3D with global convergence guarantees is shown to be a challenging problem in the existing literature even when relative position measurements are available.Motivated by angle-induced linear equations in 2D triangles and 3D tetrahedra,this paper aims to solve this challenging problem in both 2D and3D under a leader-follower framework.For the 2D case where the leaders have constant velocities,by using local relative position and velocity measurements,a formation maneuvering law is designed for the followers governed by double-integrator dynamics.When the leaders have time-varying velocities,a sliding mode formation maneuvering law is proposed by using the same measurements.For the 3D case,to establish an angle-induced linear equation for each tetrahedron,we assume that all the followers'coordinate frames share a common Z direction.Then,a formation maneuvering law is proposed for the followers to globally maneuver Z-weakly angle rigid formations in 3D.The extension to Lagrangian agent dynamics and the construction of the desired rigid formations by using the minimum number of angle constraints are also discussed.Simulation examples are provided to validate the effectiveness of the proposed algorithms.展开更多
Y Liu and C Storey(1992)proposed the famous LS conjugate gradient method which has good numerical results.However,the LS method has very weak convergence under the Wolfe-type line search.In this paper,we give a new de...Y Liu and C Storey(1992)proposed the famous LS conjugate gradient method which has good numerical results.However,the LS method has very weak convergence under the Wolfe-type line search.In this paper,we give a new descent gradient method based on the LS method.It can guarantee the sufficient descent property at each iteration and the global convergence under the strong Wolfe line search.Finally,we also present extensive preliminary numerical experiments to show the efficiency of the proposed method by comparing with the famous PRP^+method.展开更多
In this paper we propose a new family of curve search methods for unconstrained optimization problems, which are based on searching a new iterate along a curve through the current iterate at each iteration, while line...In this paper we propose a new family of curve search methods for unconstrained optimization problems, which are based on searching a new iterate along a curve through the current iterate at each iteration, while line search methods are based on finding a new iterate on a line starting from the current iterate at each iteration. The global convergence and linear convergence rate of these curve search methods are investigated under some mild conditions. Numerical results show that some curve search methods are stable and effective in solving some large scale minimization problems.展开更多
In this paper,we present a new nonlinear modified spectral CD conjugate gradient method for solving large scale unconstrained optimization problems.The direction generated by the method is a descent direction for the ...In this paper,we present a new nonlinear modified spectral CD conjugate gradient method for solving large scale unconstrained optimization problems.The direction generated by the method is a descent direction for the objective function,and this property depends neither on the line search rule,nor on the convexity of the objective function.Moreover,the modified method reduces to the standard CD method if line search is exact.Under some mild conditions,we prove that the modified method with line search is globally convergent even if the objective function is nonconvex.Preliminary numerical results show that the proposed method is very promising.展开更多
We consider a non-isentropic Euler-Poisson system with two small parameters arising in the modeling of unmagnetized plasmas and semiconductors.On the basis of the energy estimates and the compactness theorem,the unifo...We consider a non-isentropic Euler-Poisson system with two small parameters arising in the modeling of unmagnetized plasmas and semiconductors.On the basis of the energy estimates and the compactness theorem,the uniform global existence of the solutions and the combined quasi-neutral and zero-electron-mass limit of the system are proved when the initial data are close to the constant equilibrium state.In particular,the limit is rigorously justified as the two parameters tend to zero independently.展开更多
Although QP-free algorithms have good theoretical convergence and are effective in practice,their applications to minimax optimization have not yet been investigated.In this article,on the basis of the stationary cond...Although QP-free algorithms have good theoretical convergence and are effective in practice,their applications to minimax optimization have not yet been investigated.In this article,on the basis of the stationary conditions,without the exponential smooth function or constrained smooth transformation,we propose a QP-free algorithm for the nonlinear minimax optimization with inequality constraints.By means of a new and much tighter working set,we develop a new technique for constructing the sub-matrix in the lower right corner of the coefficient matrix.At each iteration,to obtain the search direction,two reduced systems of linear equations with the same coefficient are solved.Under mild conditions,the proposed algorithm is globally convergent.Finally,some preliminary numerical experiments are reported,and these show that the algorithm is promising.展开更多
Cuckoo search(CS) has been used successfully for solving global optimization problems.From a theoretical point of view,the convergence of the CS is an important issue.In this paper,convergence analysis of CS was studi...Cuckoo search(CS) has been used successfully for solving global optimization problems.From a theoretical point of view,the convergence of the CS is an important issue.In this paper,convergence analysis of CS was studied.The transition probability characteristics of the population to construct a Markov chain were analyzed.The homogeneity of the Markov chain was derived based on stochastic process theory.Then it was proved to be an absorbing state Markov chain.Consequently,the global convergence of CS was deduced based on conditions of convergence sequence and total probability formula,and the expected convergence time was given.Finally,a series of experiments were conducted.Experimental results were analyzed and it is observed that CS seems to perform better than PSO.展开更多
We proposed a generalized adaptive learning rate (GALR) PCA algorithm, which could be guaranteed that the algorithm’s convergence process would not be affected by the selection of the initial value. Using the determi...We proposed a generalized adaptive learning rate (GALR) PCA algorithm, which could be guaranteed that the algorithm’s convergence process would not be affected by the selection of the initial value. Using the deterministic discrete time (DDT) method, we gave the upper and lower bounds of the algorithm and proved the global convergence. Numerical experiments had also verified our theory, and the algorithm is effective for both online and offline data. We found that choosing different initial vectors will affect the convergence speed, and the initial vector could converge to the second or third eigenvectors by satisfying some exceptional conditions.展开更多
This paper proposes an interior-point technique for detecting the nondominated points of multi-objective optimization problems using the direction-based cone method.Cone method decomposes the multi-objective optimizat...This paper proposes an interior-point technique for detecting the nondominated points of multi-objective optimization problems using the direction-based cone method.Cone method decomposes the multi-objective optimization problems into a set of single-objective optimization problems.For this set of problems,parametric perturbed KKT conditions are derived.Subsequently,an interior point technique is developed to solve the parametric perturbed KKT conditions.A differentiable merit function is also proposed whose stationary point satisfies the KKT conditions.Under some mild assumptions,the proposed algorithm is shown to be globally convergent.Numerical results of unconstrained and constrained multi-objective optimization test problems are presented.Also,three performance metrics(modified generational distance,hypervolume,inverted generational distance)are used on some test problems to investigate the efficiency of the proposed algorithm.We also compare the results of the proposed algorithm with the results of some other existing popular methods.展开更多
Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms,two interior-point predictor-corrector algorithms for the second-order cone programming(SOCP) are presented.The two algorithms...Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms,two interior-point predictor-corrector algorithms for the second-order cone programming(SOCP) are presented.The two algorithms use the Newton direction and the Euler direction as the predictor directions,respectively.The corrector directions belong to the category of the Alizadeh-Haeberly-Overton(AHO) directions.These algorithms are suitable to the cases of feasible and infeasible interior iterative points.A simpler neighborhood of the central path for the SOCP is proposed,which is the pivotal difference from other interior-point predictor-corrector algorithms.Under some assumptions,the algorithms possess the global,linear,and quadratic convergence.The complexity bound O(rln(ε0/ε)) is obtained,where r denotes the number of the second-order cones in the SOCP problem.The numerical results show that the proposed algorithms are effective.展开更多
The box constrained variational inequality problem can be reformulated as a nonsmooth equation by using median operator.In this paper,we present a smoothing Newton method for solving the box constrained variational in...The box constrained variational inequality problem can be reformulated as a nonsmooth equation by using median operator.In this paper,we present a smoothing Newton method for solving the box constrained variational inequality problem based on a new smoothing approximation function.The proposed algorithm is proved to be well defined and convergent globally under weaker conditions.展开更多
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 traditional K-means clustering algorithm is difficult to determine the cluster number,which is sensitive to the initialization of the clustering center and easy to fall into local optimum.This paper proposes a clu...The traditional K-means clustering algorithm is difficult to determine the cluster number,which is sensitive to the initialization of the clustering center and easy to fall into local optimum.This paper proposes a clustering algorithm based on self-organizing mapping network and weight particle swarm optimization SOM&WPSO(Self-Organization Map and Weight Particle Swarm Optimization).Firstly,the algorithm takes the competitive learning mechanism of a self-organizing mapping network to divide the data samples into coarse clusters and obtain the clustering center.Then,the obtained clustering center is used as the initialization parameter of the weight particle swarm optimization algorithm.The particle position of the WPSO algorithm is determined by the traditional clustering center is improved to the sample weight,and the cluster center is the“food”of the particle group.Each particle moves toward the nearest cluster center.Each iteration optimizes the particle position and velocity and uses K-means and K-medoids recalculates cluster centers and cluster partitions until the end of the algorithm convergence iteration.After a lot of experimental analysis on the commonly used UCI data set,this paper not only solves the shortcomings of K-means clustering algorithm,the problem of dependence of the initial clustering center,and improves the accuracy of clustering,but also avoids falling into the local optimum.The algorithm has good global convergence.展开更多
The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we ...The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we combine a popular nonmonotone technique with an adaptive trust region algorithm. The new ratio to adjusting the next trust region radius is different from the ratio in the traditional trust region methods. Under some appropriate conditions, we show that the new algorithm has good global convergence and superlinear convergence.展开更多
The fast convergence without initial value dependence is the key to solving large angle relative orientation.Therefore,a hybrid conjugate gradient algorithm is proposed in this paper.The concrete process is:①stochast...The fast convergence without initial value dependence is the key to solving large angle relative orientation.Therefore,a hybrid conjugate gradient algorithm is proposed in this paper.The concrete process is:①stochastic hill climbing(SHC)algorithm is used to make a random disturbance to the given initial value of the relative orientation element,and the new value to guarantee the optimization direction is generated.②In local optimization,a super-linear convergent conjugate gradient method is used to replace the steepest descent method in relative orientation to improve its convergence rate.③The global convergence condition is that the calculation error is less than the prescribed limit error.The comparison experiment shows that the method proposed in this paper is independent of the initial value,and has higher accuracy and fewer iterations.展开更多
In this paper, the principle of Cuckoo algorithm is introduced, and the traditional Cuckoo algorithm is improved to establish a mathematical model of multi-objective optimization scheduling. Based on the improved algo...In this paper, the principle of Cuckoo algorithm is introduced, and the traditional Cuckoo algorithm is improved to establish a mathematical model of multi-objective optimization scheduling. Based on the improved algorithm, the model is optimized to a certain extent. Through analysis, it is proved that the improved algorithm has higher computational accuracy and can effectively improve the global convergence.展开更多
It is well known that Newton and quasi-Newton algorithms are effective to small and medium scale smooth problems because they take full use of corresponding gradient function’s information but fail to solve nonsmooth...It is well known that Newton and quasi-Newton algorithms are effective to small and medium scale smooth problems because they take full use of corresponding gradient function’s information but fail to solve nonsmooth problems.The perfect algorithm stems from concept of‘bundle’successfully addresses both smooth and nonsmooth complex problems,but it is regrettable that it is merely effective to small and medium optimization models since it needs to store and update relevant information of parameter’s bundle.The conjugate gradient algorithm is effective both large-scale smooth and nonsmooth optimization model since its simplicity that utilizes objective function’s information and the technique of Moreau-Yosida regularization.Thus,a modified three-term conjugate gradient algorithm was proposed,and it has a sufficiently descent property and a trust region character.At the same time,it possesses the global convergence under mild assumptions and numerical test proves it is efficient than similar optimization algorithms.展开更多
The extended linear complementarity problem(denoted by ELCP) can be reformulated as the solution of a nonsmooth system of equations. By the symmetrically perturbed CHKS smoothing function, the ELCP is approximated by ...The extended linear complementarity problem(denoted by ELCP) can be reformulated as the solution of a nonsmooth system of equations. By the symmetrically perturbed CHKS smoothing function, the ELCP is approximated by a family of parameterized smooth equations. A one-step smoothing Newton method is designed for solving the ELCP. The proposed algorithm is proved to be globally convergent under suitable assumptions.展开更多
We consider a SEIR epidemic model with infectious force in latent period and infected period under discontinuous treatment.The treatment rate has at most a finite number of jump discontinuities in every compact interv...We consider a SEIR epidemic model with infectious force in latent period and infected period under discontinuous treatment.The treatment rate has at most a finite number of jump discontinuities in every compact interval.By using Lyapunov theory for discontinuous differential equations and other techniques on non-smooth analysis,the basic reproductive number Ro is proved to be a sharp threshold value which completely determines the dynamics of the model.If Ro<1,then there exists a disease-free equilibrium which is globally stable.If Ro>1,the disease-free equilibrium becomes unstable and there exists an endemic equilibrium which is globally stable.We discuss that the disease will die out in a finite time which is impossible for the corresponding SEIR model with continuous treatment.Furthermore,the numerical simulations indicate that strengthening treatment measure after infective individuals reach some level is beneficial to disease control.展开更多
In this paper,we study a stochastic Newton method for nonlinear equations,whose exact function information is difficult to obtain while only stochastic approximations are available.At each iteration of the proposed al...In this paper,we study a stochastic Newton method for nonlinear equations,whose exact function information is difficult to obtain while only stochastic approximations are available.At each iteration of the proposed algorithm,an inexact Newton step is first computed based on stochastic zeroth-and first-order oracles.To encourage the possible reduction of the optimality error,we then take the unit step size if it is acceptable by an inexact Armijo line search condition.Otherwise,a small step size will be taken to help induce desired good properties.Then we investigate convergence properties of the proposed algorithm and obtain the almost sure global convergence under certain conditions.We also explore the computational complexities to find an approximate solution in terms of calls to stochastic zeroth-and first-order oracles,when the proposed algorithm returns a randomly chosen output.Furthermore,we analyze the local convergence properties of the algorithm and establish the local convergence rate in high probability.At last we present preliminary numerical tests and the results demonstrate the promising performances of the proposed algorithm.展开更多
基金supported by National Natural Science Foundation of China(62173118)supported by the Ramon y Cajal(RYC2020-030090-I)from the Spanish Ministry of Science。
文摘Angle rigid multi-agent formations can simultaneously undergo translational,rotational,and scaling maneuvering,therefore combining the maneuvering capabilities of both distance and bearing rigid formations.However,maneuvering angle rigid formations in 2D or 3D with global convergence guarantees is shown to be a challenging problem in the existing literature even when relative position measurements are available.Motivated by angle-induced linear equations in 2D triangles and 3D tetrahedra,this paper aims to solve this challenging problem in both 2D and3D under a leader-follower framework.For the 2D case where the leaders have constant velocities,by using local relative position and velocity measurements,a formation maneuvering law is designed for the followers governed by double-integrator dynamics.When the leaders have time-varying velocities,a sliding mode formation maneuvering law is proposed by using the same measurements.For the 3D case,to establish an angle-induced linear equation for each tetrahedron,we assume that all the followers'coordinate frames share a common Z direction.Then,a formation maneuvering law is proposed for the followers to globally maneuver Z-weakly angle rigid formations in 3D.The extension to Lagrangian agent dynamics and the construction of the desired rigid formations by using the minimum number of angle constraints are also discussed.Simulation examples are provided to validate the effectiveness of the proposed algorithms.
基金Supported by The Youth Project Foundation of Chongqing Three Gorges University(13QN17)Supported by the Fund of Scientific Research in Southeast University(the Support Project of Fundamental Research)
文摘Y Liu and C Storey(1992)proposed the famous LS conjugate gradient method which has good numerical results.However,the LS method has very weak convergence under the Wolfe-type line search.In this paper,we give a new descent gradient method based on the LS method.It can guarantee the sufficient descent property at each iteration and the global convergence under the strong Wolfe line search.Finally,we also present extensive preliminary numerical experiments to show the efficiency of the proposed method by comparing with the famous PRP^+method.
文摘In this paper we propose a new family of curve search methods for unconstrained optimization problems, which are based on searching a new iterate along a curve through the current iterate at each iteration, while line search methods are based on finding a new iterate on a line starting from the current iterate at each iteration. The global convergence and linear convergence rate of these curve search methods are investigated under some mild conditions. Numerical results show that some curve search methods are stable and effective in solving some large scale minimization problems.
基金Supported by the Key Project of 2010 Chongqing Higher Education Teaching Reform (Grant No. 102104)
文摘In this paper,we present a new nonlinear modified spectral CD conjugate gradient method for solving large scale unconstrained optimization problems.The direction generated by the method is a descent direction for the objective function,and this property depends neither on the line search rule,nor on the convexity of the objective function.Moreover,the modified method reduces to the standard CD method if line search is exact.Under some mild conditions,we prove that the modified method with line search is globally convergent even if the objective function is nonconvex.Preliminary numerical results show that the proposed method is very promising.
基金partially supported by the ISFNSFC joint research program(11761141008)NSFC(12071044 and 12131007)the NSF of Jiangsu Province(BK20191296)。
文摘We consider a non-isentropic Euler-Poisson system with two small parameters arising in the modeling of unmagnetized plasmas and semiconductors.On the basis of the energy estimates and the compactness theorem,the uniform global existence of the solutions and the combined quasi-neutral and zero-electron-mass limit of the system are proved when the initial data are close to the constant equilibrium state.In particular,the limit is rigorously justified as the two parameters tend to zero independently.
基金the Natural Science Foundation of Guangxi Province(2018GXNSFAA281099)the National Natural Science Foundation of China(11771383)the Yulin Normal University Research Grant(2019YJKY16).
文摘Although QP-free algorithms have good theoretical convergence and are effective in practice,their applications to minimax optimization have not yet been investigated.In this article,on the basis of the stationary conditions,without the exponential smooth function or constrained smooth transformation,we propose a QP-free algorithm for the nonlinear minimax optimization with inequality constraints.By means of a new and much tighter working set,we develop a new technique for constructing the sub-matrix in the lower right corner of the coefficient matrix.At each iteration,to obtain the search direction,two reduced systems of linear equations with the same coefficient are solved.Under mild conditions,the proposed algorithm is globally convergent.Finally,some preliminary numerical experiments are reported,and these show that the algorithm is promising.
基金National Natural Science Foundation of China(No.61174065)
文摘Cuckoo search(CS) has been used successfully for solving global optimization problems.From a theoretical point of view,the convergence of the CS is an important issue.In this paper,convergence analysis of CS was studied.The transition probability characteristics of the population to construct a Markov chain were analyzed.The homogeneity of the Markov chain was derived based on stochastic process theory.Then it was proved to be an absorbing state Markov chain.Consequently,the global convergence of CS was deduced based on conditions of convergence sequence and total probability formula,and the expected convergence time was given.Finally,a series of experiments were conducted.Experimental results were analyzed and it is observed that CS seems to perform better than PSO.
文摘We proposed a generalized adaptive learning rate (GALR) PCA algorithm, which could be guaranteed that the algorithm’s convergence process would not be affected by the selection of the initial value. Using the deterministic discrete time (DDT) method, we gave the upper and lower bounds of the algorithm and proved the global convergence. Numerical experiments had also verified our theory, and the algorithm is effective for both online and offline data. We found that choosing different initial vectors will affect the convergence speed, and the initial vector could converge to the second or third eigenvectors by satisfying some exceptional conditions.
基金financial support from Council of Scientific and Industrial Research,India through a research fellowship(File No.09/1217(0025)/2017-EMR-I)to carry out this research workDebdas Ghosh acknowledges the research grant(MTR/2021/000696)from SERB,India to carry out this research work.
文摘This paper proposes an interior-point technique for detecting the nondominated points of multi-objective optimization problems using the direction-based cone method.Cone method decomposes the multi-objective optimization problems into a set of single-objective optimization problems.For this set of problems,parametric perturbed KKT conditions are derived.Subsequently,an interior point technique is developed to solve the parametric perturbed KKT conditions.A differentiable merit function is also proposed whose stationary point satisfies the KKT conditions.Under some mild assumptions,the proposed algorithm is shown to be globally convergent.Numerical results of unconstrained and constrained multi-objective optimization test problems are presented.Also,three performance metrics(modified generational distance,hypervolume,inverted generational distance)are used on some test problems to investigate the efficiency of the proposed algorithm.We also compare the results of the proposed algorithm with the results of some other existing popular methods.
基金supported by the National Natural Science Foundation of China (Nos. 71061002 and 11071158)the Natural Science Foundation of Guangxi Province of China (Nos. 0832052 and 2010GXNSFB013047)
文摘Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms,two interior-point predictor-corrector algorithms for the second-order cone programming(SOCP) are presented.The two algorithms use the Newton direction and the Euler direction as the predictor directions,respectively.The corrector directions belong to the category of the Alizadeh-Haeberly-Overton(AHO) directions.These algorithms are suitable to the cases of feasible and infeasible interior iterative points.A simpler neighborhood of the central path for the SOCP is proposed,which is the pivotal difference from other interior-point predictor-corrector algorithms.Under some assumptions,the algorithms possess the global,linear,and quadratic convergence.The complexity bound O(rln(ε0/ε)) is obtained,where r denotes the number of the second-order cones in the SOCP problem.The numerical results show that the proposed algorithms are effective.
基金Supported by the NNSF of China(11071041)Supported by the Fujian Natural Science Foundation(2009J01002)Supported by the Fujian Department of Education Foundation(JA11270)
文摘The box constrained variational inequality problem can be reformulated as a nonsmooth equation by using median operator.In this paper,we present a smoothing Newton method for solving the box constrained variational inequality problem based on a new smoothing approximation function.The proposed algorithm is proved to be well defined and convergent globally under weaker conditions.
文摘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 traditional K-means clustering algorithm is difficult to determine the cluster number,which is sensitive to the initialization of the clustering center and easy to fall into local optimum.This paper proposes a clustering algorithm based on self-organizing mapping network and weight particle swarm optimization SOM&WPSO(Self-Organization Map and Weight Particle Swarm Optimization).Firstly,the algorithm takes the competitive learning mechanism of a self-organizing mapping network to divide the data samples into coarse clusters and obtain the clustering center.Then,the obtained clustering center is used as the initialization parameter of the weight particle swarm optimization algorithm.The particle position of the WPSO algorithm is determined by the traditional clustering center is improved to the sample weight,and the cluster center is the“food”of the particle group.Each particle moves toward the nearest cluster center.Each iteration optimizes the particle position and velocity and uses K-means and K-medoids recalculates cluster centers and cluster partitions until the end of the algorithm convergence iteration.After a lot of experimental analysis on the commonly used UCI data set,this paper not only solves the shortcomings of K-means clustering algorithm,the problem of dependence of the initial clustering center,and improves the accuracy of clustering,but also avoids falling into the local optimum.The algorithm has good global convergence.
文摘The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we combine a popular nonmonotone technique with an adaptive trust region algorithm. The new ratio to adjusting the next trust region radius is different from the ratio in the traditional trust region methods. Under some appropriate conditions, we show that the new algorithm has good global convergence and superlinear convergence.
基金National Natural Science Foundation of China(Nos.4156108241161061)。
文摘The fast convergence without initial value dependence is the key to solving large angle relative orientation.Therefore,a hybrid conjugate gradient algorithm is proposed in this paper.The concrete process is:①stochastic hill climbing(SHC)algorithm is used to make a random disturbance to the given initial value of the relative orientation element,and the new value to guarantee the optimization direction is generated.②In local optimization,a super-linear convergent conjugate gradient method is used to replace the steepest descent method in relative orientation to improve its convergence rate.③The global convergence condition is that the calculation error is less than the prescribed limit error.The comparison experiment shows that the method proposed in this paper is independent of the initial value,and has higher accuracy and fewer iterations.
文摘In this paper, the principle of Cuckoo algorithm is introduced, and the traditional Cuckoo algorithm is improved to establish a mathematical model of multi-objective optimization scheduling. Based on the improved algorithm, the model is optimized to a certain extent. Through analysis, it is proved that the improved algorithm has higher computational accuracy and can effectively improve the global convergence.
基金This work is supported by the National Natural Science Foundation of China(Grant No.11661009)the Guangxi Science Fund for Distinguished Young Scholars(No.2015GXNSFGA139001)+1 种基金the Guangxi Natural Science Key Fund(No.2017GXNSFDA198046)Innovation Project of Guangxi Graduate Education(No.YCSW2018046).
文摘It is well known that Newton and quasi-Newton algorithms are effective to small and medium scale smooth problems because they take full use of corresponding gradient function’s information but fail to solve nonsmooth problems.The perfect algorithm stems from concept of‘bundle’successfully addresses both smooth and nonsmooth complex problems,but it is regrettable that it is merely effective to small and medium optimization models since it needs to store and update relevant information of parameter’s bundle.The conjugate gradient algorithm is effective both large-scale smooth and nonsmooth optimization model since its simplicity that utilizes objective function’s information and the technique of Moreau-Yosida regularization.Thus,a modified three-term conjugate gradient algorithm was proposed,and it has a sufficiently descent property and a trust region character.At the same time,it possesses the global convergence under mild assumptions and numerical test proves it is efficient than similar optimization algorithms.
基金Supported by the NNSF of China(11071041, 11171257)
文摘The extended linear complementarity problem(denoted by ELCP) can be reformulated as the solution of a nonsmooth system of equations. By the symmetrically perturbed CHKS smoothing function, the ELCP is approximated by a family of parameterized smooth equations. A one-step smoothing Newton method is designed for solving the ELCP. The proposed algorithm is proved to be globally convergent under suitable assumptions.
基金supported by the National Nature Science Foundation of China(11271154).
文摘We consider a SEIR epidemic model with infectious force in latent period and infected period under discontinuous treatment.The treatment rate has at most a finite number of jump discontinuities in every compact interval.By using Lyapunov theory for discontinuous differential equations and other techniques on non-smooth analysis,the basic reproductive number Ro is proved to be a sharp threshold value which completely determines the dynamics of the model.If Ro<1,then there exists a disease-free equilibrium which is globally stable.If Ro>1,the disease-free equilibrium becomes unstable and there exists an endemic equilibrium which is globally stable.We discuss that the disease will die out in a finite time which is impossible for the corresponding SEIR model with continuous treatment.Furthermore,the numerical simulations indicate that strengthening treatment measure after infective individuals reach some level is beneficial to disease control.
基金supported by the National Natural Science Foundation of China (Nos.11731013,11871453 and 11971089)Young Elite Scientists Sponsorship Program by CAST (No.2018QNRC001)+1 种基金Youth Innovation Promotion Association,CASFundamental Research Funds for the Central Universities,UCAS.
文摘In this paper,we study a stochastic Newton method for nonlinear equations,whose exact function information is difficult to obtain while only stochastic approximations are available.At each iteration of the proposed algorithm,an inexact Newton step is first computed based on stochastic zeroth-and first-order oracles.To encourage the possible reduction of the optimality error,we then take the unit step size if it is acceptable by an inexact Armijo line search condition.Otherwise,a small step size will be taken to help induce desired good properties.Then we investigate convergence properties of the proposed algorithm and obtain the almost sure global convergence under certain conditions.We also explore the computational complexities to find an approximate solution in terms of calls to stochastic zeroth-and first-order oracles,when the proposed algorithm returns a randomly chosen output.Furthermore,we analyze the local convergence properties of the algorithm and establish the local convergence rate in high probability.At last we present preliminary numerical tests and the results demonstrate the promising performances of the proposed algorithm.