A universal numerical approach for nonlinear mathematic programming problems is presented with an application of ratios of first-order differentials/differences of objective functions to constraint functions with resp...A universal numerical approach for nonlinear mathematic programming problems is presented with an application of ratios of first-order differentials/differences of objective functions to constraint functions with respect to design variables. This approach can be efficiently used to solve continuous and, in particular, discrete programmings with arbitrary design variables and constraints. As a search method, this approach requires only computations of the functions and their partial derivatives or differences with respect to design variables, rather than any solution of mathematic equations. The present approach has been applied on many numerical examples as well as on some classical operational problems such as one-dimensional and two-dimensional knap-sack problems, one-dimensional and two-dimensional resource-distribution problems, problems of working reliability of composite systems and loading problems of machine, and more efficient and reliable solutions are obtained than traditional methods. The present approach can be used without limitation of modeling scales of the problem. Optimum solutions can be guaranteed as long as the objective function, constraint functions and their First-order derivatives/differences exist in the feasible domain or feasible set. There are no failures of convergence and instability when this approach is adopted.展开更多
Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameters in the search directions. In this note, by combining the nice numerical performance of PR and HS met...Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameters in the search directions. In this note, by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991), a class of new restarting conjugate gradient methods is presented. Global convergences of the new method with two kinds of common line searches, are proved. Firstly, it is shown that, using reverse modulus of continuity function and forcing function, the new method for solving unconstrained optimization can work for a continously dif ferentiable function with Curry-Altman's step size rule and a bounded level set. Secondly, by using comparing technique, some general convergence properties of the new method with other kind of step size rule are established. Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.展开更多
In this paper,we are concerned with the existence of the positive bounded and blow-up radial solutions of the(k1,k2)-Hessian system■where G is a nonlinear operator,Ki=Ski(λ(D^(2) z_(i)))+ψ_(i)(|x|)|▽_(zi)|^(ki),i=...In this paper,we are concerned with the existence of the positive bounded and blow-up radial solutions of the(k1,k2)-Hessian system■where G is a nonlinear operator,Ki=Ski(λ(D^(2) z_(i)))+ψ_(i)(|x|)|▽_(zi)|^(ki),i=1,2.Under the appropriate conditions on gi and g2,our main results are obtained by using the monotone iterative method and the Arzela-Ascoli theorem.Furthermore,our main results also extend the previous existence results for both the single equation and systems.展开更多
The parallel algorithms of iterated defect correction methods (PIDeCM’s) are constructed, which are of efficiency and high order B-convergence for general nonlinear stiff systems in ODE’S. As the basis of constructi...The parallel algorithms of iterated defect correction methods (PIDeCM’s) are constructed, which are of efficiency and high order B-convergence for general nonlinear stiff systems in ODE’S. As the basis of constructing and discussing PIDeCM’s. a class of parallel one-leg methods is also investigated, which are of particular efficiency for linear systems.展开更多
In this paper we discuss the degeneracy in nonlinear programming with linear constraints, and give a technique for dealing with degeneracy in a general model of reduced gradient algorithms. Under the assumption that t...In this paper we discuss the degeneracy in nonlinear programming with linear constraints, and give a technique for dealing with degeneracy in a general model of reduced gradient algorithms. Under the assumption that the objective function is continuously differentiable, we prove that either the iterative sequence {xk} generated by the method terminates at a Kuhn-Tucker point after a finite number of iterations, or any cluster point of the sequence {xk} is a KuhnTucker point.展开更多
In this note,by combining the nice numerical performance of PR and HS methods with the global convergence property of FR method,a class of new restarting three terms conjugate gradient methods is presented.Global conv...In this note,by combining the nice numerical performance of PR and HS methods with the global convergence property of FR method,a class of new restarting three terms conjugate gradient methods is presented.Global convergence properties of the new method with two kinds of common line searches are proved.展开更多
In the optimal control problem of nonlinear dynamical system,the Hamiltonian formulation is useful and powerful to solve an optimal control force.However,the resulting Euler-Lagrange equations are not easy to solve,wh...In the optimal control problem of nonlinear dynamical system,the Hamiltonian formulation is useful and powerful to solve an optimal control force.However,the resulting Euler-Lagrange equations are not easy to solve,when the performance index is complicated,because one may encounter a two-point boundary value problem of nonlinear differential algebraic equations.To be a numerical method,it is hard to exactly preserve all the specified conditions,which might deteriorate the accuracy of numerical solution.With this in mind,we develop a novel algorithm to find the solution of the optimal control problem of nonlinear Duffing oscillator,which can exactly satisfy all the required conditions for the minimality of the performance index.A new idea of shape functions method(SFM)is introduced,from which we can transform the optimal control problems to the initial value problems for the new variables,whose initial values are given arbitrarily,and meanwhile the terminal values are determined iteratively.Numerical examples confirm the high-performance of the iterative algorithms based on the SFM,which are convergence fast,and also provide very accurate solutions.The new algorithm is robust,even large noise is imposed on the input data.展开更多
Elastic impedance inversion with high efficiency and high stability has become one of the main directions of seismic pre-stack inversion. The nonlinear elastic impedance inversion method based on a fast Markov chain M...Elastic impedance inversion with high efficiency and high stability has become one of the main directions of seismic pre-stack inversion. The nonlinear elastic impedance inversion method based on a fast Markov chain Monte Carlo （MCMC） method is proposed in this paper, combining conventional MCMC method based on global optimization with a preconditioned conjugate gradient （PCG） algorithm based on local optimization, so this method does not depend strongly on the initial model. It converges to the global optimum quickly and efficiently on the condition that effi- ciency and stability of inversion are both taken into consid- eration at the same time. The test data verify the feasibility and robustness of the method, and based on this method, we extract the effective pore-fluid bulk modulus, which is applied to reservoir fluid identification and detection, and consequently, a better result has been achieved.展开更多
Data coming from different sources have different types and temporal states. Relations between one type of data and another ones, or between data and unknown parameters are almost nonlinear. It is not accurate and rel...Data coming from different sources have different types and temporal states. Relations between one type of data and another ones, or between data and unknown parameters are almost nonlinear. It is not accurate and reliable to process the data in building the digital earth with the classical least squares method or the method of the common nonlinear least squares. So a generalized nonlinear dynamic least squares method was put forward to process data in building the digital earth. A separating solution model and the iterative calculation method were used to solve the generalized nonlinear dynamic least squares problem. In fact, a complex problem can be separated and then solved by converting to two sub problems, each of which has a single variable. Therefore the dimension of unknown parameters can be reduced to its half, which simplifies the original high dimensional equations.展开更多
In this paper, we present a strong-form framework for solving the boundary value problems with geometric nonlinearity, in which an incremental theory is developed for the problem based on the Newton-Raphson scheme. Co...In this paper, we present a strong-form framework for solving the boundary value problems with geometric nonlinearity, in which an incremental theory is developed for the problem based on the Newton-Raphson scheme. Conventionally, the finite ele- ment methods （FEMs） or weak-form based meshfree methods have often been adopted to solve geometric nonlinear problems. However, issues, such as the mesh dependency, the numerical integration, and the boundary imposition, make these approaches com- putationally inefficient. Recently, strong-form collocation methods have been called on to solve the boundary value problems. The feasibility of the collocation method with the nodal discretization such as the radial basis collocation method （RBCM） motivates the present study. Due to the limited application to the nonlinear analysis in a strong form, we formulate the equation of equilibrium, along with the boundary conditions, in an incremental-iterative sense using the RBCM. The efficacy of the proposed framework is numerically demonstrated with the solution of two benchmark problems involving the geometric nonlinearity. Compared with the conventional weak-form formulation, the pro- posed framework is advantageous as no quadrature rule is needed in constructing the governing equation, and no mesh limitation exists with the deformed geometry in the increment al-it erative process.展开更多
The initial alignment error equation of an INS (Inertial Navigation System) with large initial azimuth error has been derived and nonlinear characteristics are included. When azimuth error is fairly small, the nonline...The initial alignment error equation of an INS (Inertial Navigation System) with large initial azimuth error has been derived and nonlinear characteristics are included. When azimuth error is fairly small, the nonlinear equation can be reduced to a linear one. Extended Kalman filter, iterated filter and second order filter formulas are derived for the nonlinear state equation with linear measurement equation. Simulations results show that the accuracy of azimuth error estimation using extended Kalman filter is better than that of using standard Kalman filter while the iterated filter and second order filter can give even better estimation accuracy.展开更多
Two new versions of accelerated first-order methods for minimizing convex composite functions are proposed. In this paper, we first present an accelerated first-order method which chooses the step size 1/ Lk to be 1/ ...Two new versions of accelerated first-order methods for minimizing convex composite functions are proposed. In this paper, we first present an accelerated first-order method which chooses the step size 1/ Lk to be 1/ L0 at the beginning of each iteration and preserves the computational simplicity of the fast iterative shrinkage-thresholding algorithm. The first proposed algorithm is a non-monotone algorithm. To avoid this behavior, we present another accelerated monotone first-order method. The proposed two accelerated first-order methods are proved to have a better convergence rate for minimizing convex composite functions. Numerical results demonstrate the efficiency of the proposed two accelerated first-order methods.展开更多
To solve vehicle routing problem with different fleets, two methodologies are developed. The first methodology adopts twophase strategy. In the first phase, the improved savings method is used to assign customers to a...To solve vehicle routing problem with different fleets, two methodologies are developed. The first methodology adopts twophase strategy. In the first phase, the improved savings method is used to assign customers to appropriate vehicles. In the second phase, the iterated dynasearch algorithm is adopted to route each selected vehicle with the assigned customers. The iterated dynasearch algorithm combines dynasearch algorithm with iterated local search algorithm based on random kicks. The second methodplogy adopts the idea of cyclic transfer which is performed by using dynamic programming algorithm, and the iterated dynasearch algorithm is also embedded in it. The test results show that both methodologies generate better solutions than the traditional method, and the second methodology is superior to the first one.展开更多
A brief review of the works of the author and his co-authors on the application of nonlinear analysis, numerical and analytical methods for solving the nonlinear inverse problems (synthesis problems) for optimizing th...A brief review of the works of the author and his co-authors on the application of nonlinear analysis, numerical and analytical methods for solving the nonlinear inverse problems (synthesis problems) for optimizing the different types of radiating systems, is presented in the paper. The synthesis problems are formulated in variational statements and further they are reduced to research and numerical solution of nonlinear integral equations of Hammerstein type. The existence theorems are proof, the investigation methods of nonuniqueness problem of solutions and numerical algorithms of finding the optimal solutions are proved.展开更多
Data are very important to build the digital mine. Data come from many sources, have different types and temporal states. Relations between one class of data and the other one, or between data and unknown parameters a...Data are very important to build the digital mine. Data come from many sources, have different types and temporal states. Relations between one class of data and the other one, or between data and unknown parameters are more nonlinear. The unknown parameters are non random or random, among which the random parameters often dynamically vary with time. Therefore it is not accurate and reliable to process the data in building the digital mine with the classical least squares method or the method of the common nonlinear least squares. So a generalized nonlinear dynamic least squares method to process data in building the digital mine is put forward. In the meantime, the corresponding mathematical model is also given. The generalized nonlinear least squares problem is more complex than the common nonlinear least squares problem and its solution is more difficultly obtained because the dimensions of data and parameters in the former are bigger. So a new solution model and the method are put forward to solve the generalized nonlinear dynamic least squares problem. In fact, the problem can be converted to two sub problems, each of which has a single variable. That is to say, a complex problem can be separated and then solved. So the dimension of unknown parameters can be reduced to its half, which simplifies the original high dimensional equations. The method lessens the calculating load and opens up a new way to process the data in building the digital mine, which have more sources, different types and more temporal states.展开更多
文摘A universal numerical approach for nonlinear mathematic programming problems is presented with an application of ratios of first-order differentials/differences of objective functions to constraint functions with respect to design variables. This approach can be efficiently used to solve continuous and, in particular, discrete programmings with arbitrary design variables and constraints. As a search method, this approach requires only computations of the functions and their partial derivatives or differences with respect to design variables, rather than any solution of mathematic equations. The present approach has been applied on many numerical examples as well as on some classical operational problems such as one-dimensional and two-dimensional knap-sack problems, one-dimensional and two-dimensional resource-distribution problems, problems of working reliability of composite systems and loading problems of machine, and more efficient and reliable solutions are obtained than traditional methods. The present approach can be used without limitation of modeling scales of the problem. Optimum solutions can be guaranteed as long as the objective function, constraint functions and their First-order derivatives/differences exist in the feasible domain or feasible set. There are no failures of convergence and instability when this approach is adopted.
文摘Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameters in the search directions. In this note, by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991), a class of new restarting conjugate gradient methods is presented. Global convergences of the new method with two kinds of common line searches, are proved. Firstly, it is shown that, using reverse modulus of continuity function and forcing function, the new method for solving unconstrained optimization can work for a continously dif ferentiable function with Curry-Altman's step size rule and a bounded level set. Secondly, by using comparing technique, some general convergence properties of the new method with other kind of step size rule are established. Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.
基金supported by NSFC(12001344)the Graduate Education and Teaching Innovation Project of Shanxi,China(2021YJJG142)+1 种基金the Natural Science Foundation of Chongqing(cstc2020jcyj-msxmX0123)the Technology Research Foundation of Chongqing Educational Committee(KJQN201900539 and KJQN202000528)。
文摘In this paper,we are concerned with the existence of the positive bounded and blow-up radial solutions of the(k1,k2)-Hessian system■where G is a nonlinear operator,Ki=Ski(λ(D^(2) z_(i)))+ψ_(i)(|x|)|▽_(zi)|^(ki),i=1,2.Under the appropriate conditions on gi and g2,our main results are obtained by using the monotone iterative method and the Arzela-Ascoli theorem.Furthermore,our main results also extend the previous existence results for both the single equation and systems.
文摘The parallel algorithms of iterated defect correction methods (PIDeCM’s) are constructed, which are of efficiency and high order B-convergence for general nonlinear stiff systems in ODE’S. As the basis of constructing and discussing PIDeCM’s. a class of parallel one-leg methods is also investigated, which are of particular efficiency for linear systems.
文摘In this paper we discuss the degeneracy in nonlinear programming with linear constraints, and give a technique for dealing with degeneracy in a general model of reduced gradient algorithms. Under the assumption that the objective function is continuously differentiable, we prove that either the iterative sequence {xk} generated by the method terminates at a Kuhn-Tucker point after a finite number of iterations, or any cluster point of the sequence {xk} is a KuhnTucker point.
基金Supported by the National Natural Science Foundation of China（10571106） Supported by the Fundamental Research Funds for the Central Universities（10CX04044A）
文摘In this note,by combining the nice numerical performance of PR and HS methods with the global convergence property of FR method,a class of new restarting three terms conjugate gradient methods is presented.Global convergence properties of the new method with two kinds of common line searches are proved.
文摘In the optimal control problem of nonlinear dynamical system,the Hamiltonian formulation is useful and powerful to solve an optimal control force.However,the resulting Euler-Lagrange equations are not easy to solve,when the performance index is complicated,because one may encounter a two-point boundary value problem of nonlinear differential algebraic equations.To be a numerical method,it is hard to exactly preserve all the specified conditions,which might deteriorate the accuracy of numerical solution.With this in mind,we develop a novel algorithm to find the solution of the optimal control problem of nonlinear Duffing oscillator,which can exactly satisfy all the required conditions for the minimality of the performance index.A new idea of shape functions method(SFM)is introduced,from which we can transform the optimal control problems to the initial value problems for the new variables,whose initial values are given arbitrarily,and meanwhile the terminal values are determined iteratively.Numerical examples confirm the high-performance of the iterative algorithms based on the SFM,which are convergence fast,and also provide very accurate solutions.The new algorithm is robust,even large noise is imposed on the input data.
基金the sponsorship of the National Basic Research Program of China (973 Program,2013CB228604,2014CB239201)the National Oil and Gas Major Projects of China (2011ZX05014-001-010HZ,2011ZX05014-001-006-XY570) for their funding of this research
文摘Elastic impedance inversion with high efficiency and high stability has become one of the main directions of seismic pre-stack inversion. The nonlinear elastic impedance inversion method based on a fast Markov chain Monte Carlo （MCMC） method is proposed in this paper, combining conventional MCMC method based on global optimization with a preconditioned conjugate gradient （PCG） algorithm based on local optimization, so this method does not depend strongly on the initial model. It converges to the global optimum quickly and efficiently on the condition that effi- ciency and stability of inversion are both taken into consid- eration at the same time. The test data verify the feasibility and robustness of the method, and based on this method, we extract the effective pore-fluid bulk modulus, which is applied to reservoir fluid identification and detection, and consequently, a better result has been achieved.
文摘Data coming from different sources have different types and temporal states. Relations between one type of data and another ones, or between data and unknown parameters are almost nonlinear. It is not accurate and reliable to process the data in building the digital earth with the classical least squares method or the method of the common nonlinear least squares. So a generalized nonlinear dynamic least squares method was put forward to process data in building the digital earth. A separating solution model and the iterative calculation method were used to solve the generalized nonlinear dynamic least squares problem. In fact, a complex problem can be separated and then solved by converting to two sub problems, each of which has a single variable. Therefore the dimension of unknown parameters can be reduced to its half, which simplifies the original high dimensional equations.
基金Project supported by the Ministry of Science and Technology of Taiwan(No.MOST 104-2221-E-009-193)
文摘In this paper, we present a strong-form framework for solving the boundary value problems with geometric nonlinearity, in which an incremental theory is developed for the problem based on the Newton-Raphson scheme. Conventionally, the finite ele- ment methods （FEMs） or weak-form based meshfree methods have often been adopted to solve geometric nonlinear problems. However, issues, such as the mesh dependency, the numerical integration, and the boundary imposition, make these approaches com- putationally inefficient. Recently, strong-form collocation methods have been called on to solve the boundary value problems. The feasibility of the collocation method with the nodal discretization such as the radial basis collocation method （RBCM） motivates the present study. Due to the limited application to the nonlinear analysis in a strong form, we formulate the equation of equilibrium, along with the boundary conditions, in an incremental-iterative sense using the RBCM. The efficacy of the proposed framework is numerically demonstrated with the solution of two benchmark problems involving the geometric nonlinearity. Compared with the conventional weak-form formulation, the pro- posed framework is advantageous as no quadrature rule is needed in constructing the governing equation, and no mesh limitation exists with the deformed geometry in the increment al-it erative process.
文摘The initial alignment error equation of an INS (Inertial Navigation System) with large initial azimuth error has been derived and nonlinear characteristics are included. When azimuth error is fairly small, the nonlinear equation can be reduced to a linear one. Extended Kalman filter, iterated filter and second order filter formulas are derived for the nonlinear state equation with linear measurement equation. Simulations results show that the accuracy of azimuth error estimation using extended Kalman filter is better than that of using standard Kalman filter while the iterated filter and second order filter can give even better estimation accuracy.
基金Sponsored by the National Natural Science Foundation of China(Grant No.11461021)the Natural Science Basic Research Plan in Shaanxi Province of China(Grant No.2017JM1014)
文摘Two new versions of accelerated first-order methods for minimizing convex composite functions are proposed. In this paper, we first present an accelerated first-order method which chooses the step size 1/ Lk to be 1/ L0 at the beginning of each iteration and preserves the computational simplicity of the fast iterative shrinkage-thresholding algorithm. The first proposed algorithm is a non-monotone algorithm. To avoid this behavior, we present another accelerated monotone first-order method. The proposed two accelerated first-order methods are proved to have a better convergence rate for minimizing convex composite functions. Numerical results demonstrate the efficiency of the proposed two accelerated first-order methods.
基金The National Natural Science Founda-tion of China ( No.70471039)the National Social Science Foundation of China (No.07BJY038)the Program for New Century Excellent Talents in University (No.NCET-04-0886)
文摘To solve vehicle routing problem with different fleets, two methodologies are developed. The first methodology adopts twophase strategy. In the first phase, the improved savings method is used to assign customers to appropriate vehicles. In the second phase, the iterated dynasearch algorithm is adopted to route each selected vehicle with the assigned customers. The iterated dynasearch algorithm combines dynasearch algorithm with iterated local search algorithm based on random kicks. The second methodplogy adopts the idea of cyclic transfer which is performed by using dynamic programming algorithm, and the iterated dynasearch algorithm is also embedded in it. The test results show that both methodologies generate better solutions than the traditional method, and the second methodology is superior to the first one.
文摘A brief review of the works of the author and his co-authors on the application of nonlinear analysis, numerical and analytical methods for solving the nonlinear inverse problems (synthesis problems) for optimizing the different types of radiating systems, is presented in the paper. The synthesis problems are formulated in variational statements and further they are reduced to research and numerical solution of nonlinear integral equations of Hammerstein type. The existence theorems are proof, the investigation methods of nonuniqueness problem of solutions and numerical algorithms of finding the optimal solutions are proved.
文摘Data are very important to build the digital mine. Data come from many sources, have different types and temporal states. Relations between one class of data and the other one, or between data and unknown parameters are more nonlinear. The unknown parameters are non random or random, among which the random parameters often dynamically vary with time. Therefore it is not accurate and reliable to process the data in building the digital mine with the classical least squares method or the method of the common nonlinear least squares. So a generalized nonlinear dynamic least squares method to process data in building the digital mine is put forward. In the meantime, the corresponding mathematical model is also given. The generalized nonlinear least squares problem is more complex than the common nonlinear least squares problem and its solution is more difficultly obtained because the dimensions of data and parameters in the former are bigger. So a new solution model and the method are put forward to solve the generalized nonlinear dynamic least squares problem. In fact, the problem can be converted to two sub problems, each of which has a single variable. That is to say, a complex problem can be separated and then solved. So the dimension of unknown parameters can be reduced to its half, which simplifies the original high dimensional equations. The method lessens the calculating load and opens up a new way to process the data in building the digital mine, which have more sources, different types and more temporal states.
