In this paper, we use the discontinuous exact penalty functions to solve the constrained minimization problems with an integral approach. We examine a general form of the constrained deviation integral and its analyti...In this paper, we use the discontinuous exact penalty functions to solve the constrained minimization problems with an integral approach. We examine a general form of the constrained deviation integral and its analytical properties. The optimality conditions of the penalized minimization problems are proven. To implement the al- gorithm, the cross-entropy method and the importance sampling are used based on the Monte-Carlo technique. Numerical tests show the effectiveness of the proposed algorithm.展开更多
The constrained global optimization problem being considered, a modified integral_level set method was illustrated based on Chew_Zheng's paper on Integral Global Optimization and (Wu's) paper on Implementable ...The constrained global optimization problem being considered, a modified integral_level set method was illustrated based on Chew_Zheng's paper on Integral Global Optimization and (Wu's) paper on Implementable Algorithm Convergence of Modified Integral_Level Set Method for Global Optimization Problem. It has two characters: 1) Each phase must construct a new function which has the same global optimal value as that of primitive objective function; 2) Comparing it with (Zheng's) method, solving level set procedure is avoided. An implementable algorithm also is given and it is proved that this algorithm is convergent.展开更多
A class of discontinuous penalty functions was proposed to solve constrained minimization problems with the integral approach to global optimization, m-mean value and v-variance optimality conditions of a constrained ...A class of discontinuous penalty functions was proposed to solve constrained minimization problems with the integral approach to global optimization, m-mean value and v-variance optimality conditions of a constrained and penalized minimization problem were investigated. A nonsequential algorithm was proposed. Numerical examples were given to illustrate the effectiveness of the algorithm.展开更多
The penalty method is a popular method for solving constrained optimization problems, which can change the constrained optimization to the unconstrained optimization. With the integral-level set method, a new approach...The penalty method is a popular method for solving constrained optimization problems, which can change the constrained optimization to the unconstrained optimization. With the integral-level set method, a new approach was proposed, which is briefer than the penalty method, to achieve the transform by constructing a simple function, then a level-value function was introduced to construct the equivalence between the unconstrained optimization and a nonlinear equality. By studying the properties of the function, a level-value estimate algorithm and an implementation algorithm were given by means of the uniform distribution of the good point set. Key words global optimization - constrained optimization - integral-level set - level-value estimate MSC 2000 90C05展开更多
A class of trust region methods for solving linear inequality constrained problems is proposed in this paper. It is shown that the algorithm is of global convergence.The algorithm uses a version of the two-sided proje...A class of trust region methods for solving linear inequality constrained problems is proposed in this paper. It is shown that the algorithm is of global convergence.The algorithm uses a version of the two-sided projection and the strategy of the unconstrained trust region methods. It keeps the good convergence properties of the unconstrained case and has the merits of the projection method. In some sense, our algorithm can be regarded as an extension and improvement of the projected type algorithm.展开更多
This paper presents a trust region two phase model algorithm for solving the equality and bound constrained nonlinear optimization problem. A concept of substationary point is given. Under suitable assumptions,the gl...This paper presents a trust region two phase model algorithm for solving the equality and bound constrained nonlinear optimization problem. A concept of substationary point is given. Under suitable assumptions,the global convergence of this algorithm is proved without assuming the linear independence of the gradient of active constraints. A numerical example is also presented.展开更多
The authors consider optimization methods for box constrained variational inequalities. First, the authors study the KKT-conditions problem based on the original problem. A merit function for the KKT-conditions proble...The authors consider optimization methods for box constrained variational inequalities. First, the authors study the KKT-conditions problem based on the original problem. A merit function for the KKT-conditions problem is proposed, and some desirable properties of the merit function are obtained. Through the merit function, the original problem is reformulated as minimization with simple constraints. Then, the authors show that any stationary point of the optimization problem is a solution of the original problem. Finally, a descent algorithm is presented for the optimization problem, and global convergence is shown.展开更多
By introducing a smooth merit function for the median function, a new smooth merit function for box constrained variational inequalities (BVIs) was constructed. The function is simple and has some good differential pr...By introducing a smooth merit function for the median function, a new smooth merit function for box constrained variational inequalities (BVIs) was constructed. The function is simple and has some good differential properties. A damped Newton type method was presented based on it.Global and local superlinear/quadratic convergence results were obtained under mild conditions, and the finite termination property was also shown for the linear BVIs. Numerical results suggest that the method is efficient and promising.展开更多
By introducing a smooth merit function for the median function, a new smooth merit function for box constrained variational inequalities （BVIs） was constructed. The function is simple and has some good differential ...By introducing a smooth merit function for the median function, a new smooth merit function for box constrained variational inequalities （BVIs） was constructed. The function is simple and has some good differential properties. A damped Newton type method was presented based on it. Global and local superlinear/ quadratic convergence results were obtained under mild conditions, and the finite termination property was also shown for the linear BVIs. Numerical results suggest that the method is efficient and promising.展开更多
In this paper, a smoothing QP-free infeasible method is proposed for nonlinear inequality constrained optimization problems. This iterative method is based on the solution of nonlinear equations which is obtained by t...In this paper, a smoothing QP-free infeasible method is proposed for nonlinear inequality constrained optimization problems. This iterative method is based on the solution of nonlinear equations which is obtained by the multipliers and the smoothing FisheroBurmeister function for the KKT first-order optimality conditions. Comparing with other QP-free methods, this method does not request the strict feasibility of iteration. In particular, this method is implementable and globally convergent without assuming the strict complementarity condition and the isolatedness of accumulation points. ~rthermore, the gradients of active constraints are not requested to be linearly independent. Preliminary numerical results indicate that this smoothing QP-free infeasible method is quite promising.展开更多
A potential reduction algorithm is proposed for optimization of a convex function subject to linear constraints.At each step of the algorithm,a system of linear equations is solved to get a search direction and the Ar...A potential reduction algorithm is proposed for optimization of a convex function subject to linear constraints.At each step of the algorithm,a system of linear equations is solved to get a search direction and the Armijo's rule is used to determine a stepsize.It is proved that the algorithm is globally convergent.Computational results are reported.展开更多
The global solution for a coupled nonlinear Klein-Gordon system in two- dimensional space was studied. First, a sharp threshold of blowup and global existence for the system was obtained by constructing a type of cros...The global solution for a coupled nonlinear Klein-Gordon system in two- dimensional space was studied. First, a sharp threshold of blowup and global existence for the system was obtained by constructing a type of cross-constrained variational problem and establishing so-called cross-invariant manifolds of the evolution flow. Then the result of how small the initial data for which the solution exists globally was proved by using the scaling argument.展开更多
This paper presents an approach that directly utilizes the Hessian matrix to investigate the existence and uniqueness of global solutions for the ECQP problem. The novel features of this proposed algorithm are its uni...This paper presents an approach that directly utilizes the Hessian matrix to investigate the existence and uniqueness of global solutions for the ECQP problem. The novel features of this proposed algorithm are its uniqueness and faster rate of convergence to the solution. The merit of this algorithm is base on cost, accuracy and number of operations.展开更多
In this paper, a modified variation of the Limited SQP method is presented for constrained optimization. This method possesses not only the information of gradient but also the information of function value. Moreover,...In this paper, a modified variation of the Limited SQP method is presented for constrained optimization. This method possesses not only the information of gradient but also the information of function value. Moreover, the proposed method requires no more function or derivative evaluations and hardly more storage or arithmetic operations. Under suitable conditions, the global convergence is established.展开更多
This paper focuses on studying the generalized geometry theory of constrained rotating relativistic Birkhoffian systems. Based on the fact that relativistic rotating inertia is embedded in the Birkhoffian systems, the...This paper focuses on studying the generalized geometry theory of constrained rotating relativistic Birkhoffian systems. Based on the fact that relativistic rotating inertia is embedded in the Birkhoffian systems, the Pfaff action of rotating relativistic Birkhoffian systems was defined. The Pfaff-Birkhoff principles and Birkhoff＇s equations of the constrained rotating relativistic systems were obtained. The geometrical description, the exact properties and their forms on R T^＊M for the constrained rotating relativistic Birkhoffian systems are given. The global analyses of the autonomous, semi-autonomous and non-autonomous constrained relativistic Birkhoff＇s equations as well as the geometrical properties of energy change for the constrained rotating relativistic Birkhoffian systems were also conducted.展开更多
A trust region algorithm for equality constrained optimization is given in this paper.The algorithm does not enforce strict monotonicity of the merit function for every iteration.Global convergence of the algorithm i...A trust region algorithm for equality constrained optimization is given in this paper.The algorithm does not enforce strict monotonicity of the merit function for every iteration.Global convergence of the algorithm is proved under the same conditions of usual trust region method.展开更多
In this paper, the analytic solutions to constrained optimal control problems are considered. A novel approach based on canonical duality theory is developed to derive the analytic solution of this problem by reformul...In this paper, the analytic solutions to constrained optimal control problems are considered. A novel approach based on canonical duality theory is developed to derive the analytic solution of this problem by reformulating a constrained optimal control problem into a global optimization problem. A differential flow is presented to deduce some optimality conditions for solving global optimizations, which can be considered as an extension and a supplement of the previous results in canonical duality theory. Some examples are given to illustrate the applicability of our results.展开更多
A new smooth gap function for the box constrained variational inequality problem （VIP） is proposed based on an integral global optimality condition. The smooth gap function is simple and has some good differentiable...A new smooth gap function for the box constrained variational inequality problem （VIP） is proposed based on an integral global optimality condition. The smooth gap function is simple and has some good differentiable properties. The box constrained VIP can be reformulated as a differentiable optimization problem by the proposed smooth gap function. The conditions, under which any stationary point of the optimization problem is the solution to the box constrained VIP, are discussed. A simple frictional contact problem is analyzed to show the applications of the smooth gap function. Finally, the numerical experiments confirm the good theoretical properties of the method.展开更多
基金supported by the National Natural Science Foundation of China (No. 10771133)the KeyDisciplines of Shanghai Municipality (Operations Research and Cybernetics) (No. S30104)
文摘In this paper, we use the discontinuous exact penalty functions to solve the constrained minimization problems with an integral approach. We examine a general form of the constrained deviation integral and its analytical properties. The optimality conditions of the penalized minimization problems are proven. To implement the al- gorithm, the cross-entropy method and the importance sampling are used based on the Monte-Carlo technique. Numerical tests show the effectiveness of the proposed algorithm.
文摘The constrained global optimization problem being considered, a modified integral_level set method was illustrated based on Chew_Zheng's paper on Integral Global Optimization and (Wu's) paper on Implementable Algorithm Convergence of Modified Integral_Level Set Method for Global Optimization Problem. It has two characters: 1) Each phase must construct a new function which has the same global optimal value as that of primitive objective function; 2) Comparing it with (Zheng's) method, solving level set procedure is avoided. An implementable algorithm also is given and it is proved that this algorithm is convergent.
文摘A class of discontinuous penalty functions was proposed to solve constrained minimization problems with the integral approach to global optimization, m-mean value and v-variance optimality conditions of a constrained and penalized minimization problem were investigated. A nonsequential algorithm was proposed. Numerical examples were given to illustrate the effectiveness of the algorithm.
文摘The penalty method is a popular method for solving constrained optimization problems, which can change the constrained optimization to the unconstrained optimization. With the integral-level set method, a new approach was proposed, which is briefer than the penalty method, to achieve the transform by constructing a simple function, then a level-value function was introduced to construct the equivalence between the unconstrained optimization and a nonlinear equality. By studying the properties of the function, a level-value estimate algorithm and an implementation algorithm were given by means of the uniform distribution of the good point set. Key words global optimization - constrained optimization - integral-level set - level-value estimate MSC 2000 90C05
文摘A class of trust region methods for solving linear inequality constrained problems is proposed in this paper. It is shown that the algorithm is of global convergence.The algorithm uses a version of the two-sided projection and the strategy of the unconstrained trust region methods. It keeps the good convergence properties of the unconstrained case and has the merits of the projection method. In some sense, our algorithm can be regarded as an extension and improvement of the projected type algorithm.
文摘This paper presents a trust region two phase model algorithm for solving the equality and bound constrained nonlinear optimization problem. A concept of substationary point is given. Under suitable assumptions,the global convergence of this algorithm is proved without assuming the linear independence of the gradient of active constraints. A numerical example is also presented.
基金the National Natural Science Foundation of China(No.19971002)
文摘The authors consider optimization methods for box constrained variational inequalities. First, the authors study the KKT-conditions problem based on the original problem. A merit function for the KKT-conditions problem is proposed, and some desirable properties of the merit function are obtained. Through the merit function, the original problem is reformulated as minimization with simple constraints. Then, the authors show that any stationary point of the optimization problem is a solution of the original problem. Finally, a descent algorithm is presented for the optimization problem, and global convergence is shown.
基金Project supported by the Teaching and Research Award Program for the Outstanding YoungTeachers in Higher Education Institutes of Munistry of Education, P.R.China
文摘By introducing a smooth merit function for the median function, a new smooth merit function for box constrained variational inequalities (BVIs) was constructed. The function is simple and has some good differential properties. A damped Newton type method was presented based on it.Global and local superlinear/quadratic convergence results were obtained under mild conditions, and the finite termination property was also shown for the linear BVIs. Numerical results suggest that the method is efficient and promising.
文摘By introducing a smooth merit function for the median function, a new smooth merit function for box constrained variational inequalities （BVIs） was constructed. The function is simple and has some good differential properties. A damped Newton type method was presented based on it. Global and local superlinear/ quadratic convergence results were obtained under mild conditions, and the finite termination property was also shown for the linear BVIs. Numerical results suggest that the method is efficient and promising.
基金Supported-by the National Natural Science Foundation of China(10371089)and the Foundation of Qingdao University
文摘In this paper, a smoothing QP-free infeasible method is proposed for nonlinear inequality constrained optimization problems. This iterative method is based on the solution of nonlinear equations which is obtained by the multipliers and the smoothing FisheroBurmeister function for the KKT first-order optimality conditions. Comparing with other QP-free methods, this method does not request the strict feasibility of iteration. In particular, this method is implementable and globally convergent without assuming the strict complementarity condition and the isolatedness of accumulation points. ~rthermore, the gradients of active constraints are not requested to be linearly independent. Preliminary numerical results indicate that this smoothing QP-free infeasible method is quite promising.
文摘A potential reduction algorithm is proposed for optimization of a convex function subject to linear constraints.At each step of the algorithm,a system of linear equations is solved to get a search direction and the Armijo's rule is used to determine a stepsize.It is proved that the algorithm is globally convergent.Computational results are reported.
基金Project supported by the National Natural Science Foundation of China (No.10271084)the Natural Science Foundation for Young Scholars of Sichuan Province of China (No.07JQ0094)
文摘The global solution for a coupled nonlinear Klein-Gordon system in two- dimensional space was studied. First, a sharp threshold of blowup and global existence for the system was obtained by constructing a type of cross-constrained variational problem and establishing so-called cross-invariant manifolds of the evolution flow. Then the result of how small the initial data for which the solution exists globally was proved by using the scaling argument.
文摘This paper presents an approach that directly utilizes the Hessian matrix to investigate the existence and uniqueness of global solutions for the ECQP problem. The novel features of this proposed algorithm are its uniqueness and faster rate of convergence to the solution. The merit of this algorithm is base on cost, accuracy and number of operations.
文摘In this paper, a modified variation of the Limited SQP method is presented for constrained optimization. This method possesses not only the information of gradient but also the information of function value. Moreover, the proposed method requires no more function or derivative evaluations and hardly more storage or arithmetic operations. Under suitable conditions, the global convergence is established.
基金Project supported by the National Natural Science Foundation of China （Grant Nos.10672143, 10372053）, and the Natural Science Foundation of Henan Province （Grant Nos.03011011400, 05011022200）
文摘This paper focuses on studying the generalized geometry theory of constrained rotating relativistic Birkhoffian systems. Based on the fact that relativistic rotating inertia is embedded in the Birkhoffian systems, the Pfaff action of rotating relativistic Birkhoffian systems was defined. The Pfaff-Birkhoff principles and Birkhoff＇s equations of the constrained rotating relativistic systems were obtained. The geometrical description, the exact properties and their forms on R T^＊M for the constrained rotating relativistic Birkhoffian systems are given. The global analyses of the autonomous, semi-autonomous and non-autonomous constrained relativistic Birkhoff＇s equations as well as the geometrical properties of energy change for the constrained rotating relativistic Birkhoffian systems were also conducted.
文摘A trust region algorithm for equality constrained optimization is given in this paper.The algorithm does not enforce strict monotonicity of the merit function for every iteration.Global convergence of the algorithm is proved under the same conditions of usual trust region method.
文摘In this paper, the analytic solutions to constrained optimal control problems are considered. A novel approach based on canonical duality theory is developed to derive the analytic solution of this problem by reformulating a constrained optimal control problem into a global optimization problem. A differential flow is presented to deduce some optimality conditions for solving global optimizations, which can be considered as an extension and a supplement of the previous results in canonical duality theory. Some examples are given to illustrate the applicability of our results.
基金Project supported by the National Natural Science Foundation of China(Nos.10902077,11172209, and 10572031)
文摘A new smooth gap function for the box constrained variational inequality problem （VIP） is proposed based on an integral global optimality condition. The smooth gap function is simple and has some good differentiable properties. The box constrained VIP can be reformulated as a differentiable optimization problem by the proposed smooth gap function. The conditions, under which any stationary point of the optimization problem is the solution to the box constrained VIP, are discussed. A simple frictional contact problem is analyzed to show the applications of the smooth gap function. Finally, the numerical experiments confirm the good theoretical properties of the method.
