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.展开更多
In this paper we prove that a class of trust region methods presented in part I is superlinearly convergent. Numerical tests are reported thereafter. Results by solving a set of typical problems selected from literatu...In this paper we prove that a class of trust region methods presented in part I is superlinearly convergent. Numerical tests are reported thereafter. Results by solving a set of typical problems selected from literatures have demonstrated that our algorithm is effective.展开更多
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.展开更多
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.展开更多
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.展开更多
This paper considers the approaches and methods for reducing the influence of multi-collinearity. Great attention is paid to the question of using shrinkage estimators for this purpose. Two classes of regression model...This paper considers the approaches and methods for reducing the influence of multi-collinearity. Great attention is paid to the question of using shrinkage estimators for this purpose. Two classes of regression models are investigated, the first of which corresponds to systems with a negative feedback, while the second class presents systems without the feedback. In the first case the use of shrinkage estimators, especially the Principal Component estimator, is inappropriate but is possible in the second case with the right choice of the regularization parameter or of the number of principal components included in the regression model. This fact is substantiated by the study of the distribution of the random variable , where b is the LS estimate and β is the true coefficient, since the form of this distribution is the basic characteristic of the specified classes. For this study, a regression approximation of the distribution of the event based on the Edgeworth series was developed. Also, alternative approaches are examined to resolve the multicollinearity issue, including an application of the known Inequality Constrained Least Squares method and the Dual estimator method proposed by the author. It is shown that with a priori information the Euclidean distance between the estimates and the true coefficients can be significantly reduced.展开更多
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.展开更多
In this paper, an improved feasible QP-free method is proposed to solve nonlinear inequality constrained optimization problems. Here, a new modified method is presented to obtain the revised feasible descent direction...In this paper, an improved feasible QP-free method is proposed to solve nonlinear inequality constrained optimization problems. Here, a new modified method is presented to obtain the revised feasible descent direction. In view of the computational cost, the most attractive feature of the new algorithm is that only one system of linear equations is required to obtain the revised feasible descent direction. Thereby, per single iteration, it is only necessary to solve three systems of linear equations with the same coefficient matrix. In particular, without the positive definiteness assumption on the Hessian estimate, the proposed algorithm is still global convergence. Under some suitable conditions, the superlinear convergence rate is obtained.展开更多
This paper presents a new trust-region algorithm for n-dimension nonlinear optimization subject to m nonlinear inequality constraints. Equivalent KKT conditions are derived, which is the basis for constructing the new...This paper presents a new trust-region algorithm for n-dimension nonlinear optimization subject to m nonlinear inequality constraints. Equivalent KKT conditions are derived, which is the basis for constructing the new algorithm. Global convergence of the algorithm to a first-order KKT point is established under mild conditions on the trial steps, local quadratic convergence theorem is proved for nondegenerate minimizer point. Numerical experiment is presented to show the effectiveness of our approach.展开更多
This paper presents a strong subfeasible directions algorithm possessing superlinear convergence for inequality constrained optimization. The starting point of this algorithm may be arbitary and its feasibility is mon...This paper presents a strong subfeasible directions algorithm possessing superlinear convergence for inequality constrained optimization. The starting point of this algorithm may be arbitary and its feasibility is monotonically increasing. The search directions only depend on solving one quadratic proraming and its simple correction, its line search is simple straight search and does not depend on any penalty function. Under suit assumptions, the algorithm is proved to possess global and superlinear convergence.展开更多
In this paper, we first give a smoothing approximation function of nonsmooth system based on box constrained variational inequalities and then present a new smoothing approximation algorithm. Under suitable conditions...In this paper, we first give a smoothing approximation function of nonsmooth system based on box constrained variational inequalities and then present a new smoothing approximation algorithm. Under suitable conditions,we show that the method is globally and superlinearly convergent. A few numerical results are also reported in the paper.展开更多
文摘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.
文摘In this paper we prove that a class of trust region methods presented in part I is superlinearly convergent. Numerical tests are reported thereafter. Results by solving a set of typical problems selected from literatures have demonstrated that our algorithm is effective.
基金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.
文摘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.
基金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.
文摘This paper considers the approaches and methods for reducing the influence of multi-collinearity. Great attention is paid to the question of using shrinkage estimators for this purpose. Two classes of regression models are investigated, the first of which corresponds to systems with a negative feedback, while the second class presents systems without the feedback. In the first case the use of shrinkage estimators, especially the Principal Component estimator, is inappropriate but is possible in the second case with the right choice of the regularization parameter or of the number of principal components included in the regression model. This fact is substantiated by the study of the distribution of the random variable , where b is the LS estimate and β is the true coefficient, since the form of this distribution is the basic characteristic of the specified classes. For this study, a regression approximation of the distribution of the event based on the Edgeworth series was developed. Also, alternative approaches are examined to resolve the multicollinearity issue, including an application of the known Inequality Constrained Least Squares method and the Dual estimator method proposed by the author. It is shown that with a priori information the Euclidean distance between the estimates and the true coefficients can be significantly reduced.
基金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.
基金Supported by National Natural Science Foundation of China (Grant Nos. 11061011 and 71061002)Guangxi Fund for Distinguished Young Scholars (2012GXSFFA060003)
文摘In this paper, an improved feasible QP-free method is proposed to solve nonlinear inequality constrained optimization problems. Here, a new modified method is presented to obtain the revised feasible descent direction. In view of the computational cost, the most attractive feature of the new algorithm is that only one system of linear equations is required to obtain the revised feasible descent direction. Thereby, per single iteration, it is only necessary to solve three systems of linear equations with the same coefficient matrix. In particular, without the positive definiteness assumption on the Hessian estimate, the proposed algorithm is still global convergence. Under some suitable conditions, the superlinear convergence rate is obtained.
基金the Scientific Research Foundation of Hunan Provincial Education Department, No. 02B021, and the National Natural Science Foundation of China, No. 10171008.
文摘This paper presents a new trust-region algorithm for n-dimension nonlinear optimization subject to m nonlinear inequality constraints. Equivalent KKT conditions are derived, which is the basis for constructing the new algorithm. Global convergence of the algorithm to a first-order KKT point is established under mild conditions on the trial steps, local quadratic convergence theorem is proved for nondegenerate minimizer point. Numerical experiment is presented to show the effectiveness of our approach.
基金Supported by the National Natural Sciences Foundation of China (No.39830070 and 10171055).
文摘In this paper, a new SQP method for inequality constrained optimization is proposed and the global convergence is obtained under very mild conditions.
文摘This paper presents a strong subfeasible directions algorithm possessing superlinear convergence for inequality constrained optimization. The starting point of this algorithm may be arbitary and its feasibility is monotonically increasing. The search directions only depend on solving one quadratic proraming and its simple correction, its line search is simple straight search and does not depend on any penalty function. Under suit assumptions, the algorithm is proved to possess global and superlinear convergence.
文摘In this paper, we first give a smoothing approximation function of nonsmooth system based on box constrained variational inequalities and then present a new smoothing approximation algorithm. Under suitable conditions,we show that the method is globally and superlinearly convergent. A few numerical results are also reported in the paper.