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.展开更多
A one_step smoothing Newton method is proposed for solving the vertical linear complementarity problem based on the so_called aggregation function. The proposed algorithm has the following good features: (ⅰ) It solve...A one_step smoothing Newton method is proposed for solving the vertical linear complementarity problem based on the so_called aggregation function. The proposed algorithm has the following good features: (ⅰ) It solves only one linear system of equations and does only one line search at each iteration; (ⅱ) It is well_defined for the vertical linear complementarity problem with vertical block P 0 matrix and any accumulation point of iteration sequence is its solution.Moreover, the iteration sequence is bounded for the vertical linear complementarity problem with vertical block P 0+R 0 matrix; (ⅲ) It has both global linear and local quadratic convergence without strict complementarity. Many existing smoothing Newton methods do not have the property (ⅲ).展开更多
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.展开更多
Based on a smoothing symmetric disturbance FB-function,a smoothing inexact Newton method for solving the nonlinear complementarity problem with P0-function was proposed.It was proved that under mild conditions,the giv...Based on a smoothing symmetric disturbance FB-function,a smoothing inexact Newton method for solving the nonlinear complementarity problem with P0-function was proposed.It was proved that under mild conditions,the given algorithm performed global and superlinear convergence without strict complementarity.For the same linear complementarity problem(LCP),the algorithm needs similar iteration times to the literature.However,its accuracy is improved by at least 4 orders with calculation time reduced by almost 50%,and the iterative number is insensitive to the size of the LCP.Moreover,fewer iterations and shorter time are required for solving the problem by using inexact Newton methods for different initial points.展开更多
In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space w...In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.展开更多
针对光滑孪生支持向量机(smooth twin support vector machines,STWSVM)采用的Sigmoid光滑函数逼近精度低的问题,提出一种基于Newton-Armijo优化的多项式光滑孪生支持向量机(polynomial smooth twin support vector machines based on N...针对光滑孪生支持向量机(smooth twin support vector machines,STWSVM)采用的Sigmoid光滑函数逼近精度低的问题,提出一种基于Newton-Armijo优化的多项式光滑孪生支持向量机(polynomial smooth twin support vector machines based on Newton-Armijo optimization,PSTWSVM-NA)。在PSTWSVM-NA中,引入正号函数,将孪生支持向量机的两个二次规划问题转化为两个不可微的无约束优化问题。随后,引入一族多项式光滑函数对不可微的无约束优化问题进行光滑逼近,并用收敛速度快的Newton-Armijo方法求解新模型。从理论上证明了PSTWSVM-NA模型具有任意阶光滑性,在人工数据和UCI数据集上的实验结果表明该算法具有较高的分类精度和较快的训练效率。展开更多
We propose a one–step smoothing Newton method for solving the non-linearcomplementarity problem with P 0–function (P_0–NCP) based on the smoothing symmetric perturbedFisher function (for short, denoted as the SSPF...We propose a one–step smoothing Newton method for solving the non-linearcomplementarity problem with P 0–function (P_0–NCP) based on the smoothing symmetric perturbedFisher function (for short, denoted as the SSPF–function). The proposed algorithm has to solve onlyone linear system of equations and performs only one line search per iteration. Without requiringany strict complementarity assumption at the P_0–NCP solution, we show that the proposed algorithmconverges globally and superlinearly under mild conditions. Furthermore, the algorithm has localquadratic convergence under suitable conditions. The main feature of our global convergence resultsis that we do not assume a priori the existence of an accumulation point. Compared to the previousliteratures, our algorithm has stronger convergence results under weaker conditions.展开更多
We consider an inverse quadratic programming (IQP) problem in which the parameters in the objective function of a given quadratic programming (QP) problem are adjusted as little as possible so that a known feasibl...We consider an inverse quadratic programming (IQP) problem in which the parameters in the objective function of a given quadratic programming (QP) problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. This problem can be formulated as a minimization problem with a positive semidefinite cone constraint and its dual (denoted IQD(A, b)) is a semismoothly differentiable (SC^1) convex programming problem with fewer variables than the original one. In this paper a smoothing Newton method is used for getting a Karush-Kuhn-Tucker point of IQD(A, b). The proposed method needs to solve only one linear system per iteration and achieves quadratic convergence. Numerical experiments are reported to show that the smoothing Newton method is effective for solving this class of inverse quadratic programming problems.展开更多
We consider a class of mathematical programs governed by parameterized quasi-variational inequalities(QVI).The necessary optimality conditions for the optimization problem with QVI constraints are reformulated as a sy...We consider a class of mathematical programs governed by parameterized quasi-variational inequalities(QVI).The necessary optimality conditions for the optimization problem with QVI constraints are reformulated as a system of nonsmooth equations under the linear independence constraint qualification and the strict slackness condition.A set of second order sufficient conditions for the mathematical program with parameterized QVI constraints are proposed,which are demonstrated to be sufficient for the second order growth condition.The strongly BD-regularity for the nonsmooth system of equations at a solution point is demonstrated under the second order sufficient conditions.The smoothing Newton method in Qi-Sun-Zhou [2000] is employed to solve this nonsmooth system and the quadratic convergence is guaranteed by the strongly BD-regularity.Numerical experiments are reported to show that the smoothing Newton method is very effective for solving this class of optimization problems.展开更多
基金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.
文摘A one_step smoothing Newton method is proposed for solving the vertical linear complementarity problem based on the so_called aggregation function. The proposed algorithm has the following good features: (ⅰ) It solves only one linear system of equations and does only one line search at each iteration; (ⅱ) It is well_defined for the vertical linear complementarity problem with vertical block P 0 matrix and any accumulation point of iteration sequence is its solution.Moreover, the iteration sequence is bounded for the vertical linear complementarity problem with vertical block P 0+R 0 matrix; (ⅲ) It has both global linear and local quadratic convergence without strict complementarity. Many existing smoothing Newton methods do not have the property (ⅲ).
基金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 Natural Science Foundation of China(No.51205286)
文摘Based on a smoothing symmetric disturbance FB-function,a smoothing inexact Newton method for solving the nonlinear complementarity problem with P0-function was proposed.It was proved that under mild conditions,the given algorithm performed global and superlinear convergence without strict complementarity.For the same linear complementarity problem(LCP),the algorithm needs similar iteration times to the literature.However,its accuracy is improved by at least 4 orders with calculation time reduced by almost 50%,and the iterative number is insensitive to the size of the LCP.Moreover,fewer iterations and shorter time are required for solving the problem by using inexact Newton methods for different initial points.
基金supported by the National Natural Science Foundation of China(11401126,71471140 and 11361018)Guangxi Natural Science Foundation(2016GXNSFBA380102 and 2014GXNSFFA118001)+2 种基金Guangxi Key Laboratory of Cryptography and Information Security(GCIS201618)Guangxi Key Laboratory of Automatic Detecting Technology and Instruments(YQ15112 and YQ16112)China
文摘In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.
文摘针对光滑孪生支持向量机(smooth twin support vector machines,STWSVM)采用的Sigmoid光滑函数逼近精度低的问题,提出一种基于Newton-Armijo优化的多项式光滑孪生支持向量机(polynomial smooth twin support vector machines based on Newton-Armijo optimization,PSTWSVM-NA)。在PSTWSVM-NA中,引入正号函数,将孪生支持向量机的两个二次规划问题转化为两个不可微的无约束优化问题。随后,引入一族多项式光滑函数对不可微的无约束优化问题进行光滑逼近,并用收敛速度快的Newton-Armijo方法求解新模型。从理论上证明了PSTWSVM-NA模型具有任意阶光滑性,在人工数据和UCI数据集上的实验结果表明该算法具有较高的分类精度和较快的训练效率。
基金This work is partly supported by the National Natural Science Foundation of China(Grant,Nos.10271002,10201001)
文摘We propose a one–step smoothing Newton method for solving the non-linearcomplementarity problem with P 0–function (P_0–NCP) based on the smoothing symmetric perturbedFisher function (for short, denoted as the SSPF–function). The proposed algorithm has to solve onlyone linear system of equations and performs only one line search per iteration. Without requiringany strict complementarity assumption at the P_0–NCP solution, we show that the proposed algorithmconverges globally and superlinearly under mild conditions. Furthermore, the algorithm has localquadratic convergence under suitable conditions. The main feature of our global convergence resultsis that we do not assume a priori the existence of an accumulation point. Compared to the previousliteratures, our algorithm has stronger convergence results under weaker conditions.
基金supported by the National Natural Science Foundation of China under project No. 10771026by the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry of China
文摘We consider an inverse quadratic programming (IQP) problem in which the parameters in the objective function of a given quadratic programming (QP) problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. This problem can be formulated as a minimization problem with a positive semidefinite cone constraint and its dual (denoted IQD(A, b)) is a semismoothly differentiable (SC^1) convex programming problem with fewer variables than the original one. In this paper a smoothing Newton method is used for getting a Karush-Kuhn-Tucker point of IQD(A, b). The proposed method needs to solve only one linear system per iteration and achieves quadratic convergence. Numerical experiments are reported to show that the smoothing Newton method is effective for solving this class of inverse quadratic programming problems.
基金supported by National Natural Science Foundation of China (Grant No.11071029)the Fundamental Research Funds for the Central Universities
文摘We consider a class of mathematical programs governed by parameterized quasi-variational inequalities(QVI).The necessary optimality conditions for the optimization problem with QVI constraints are reformulated as a system of nonsmooth equations under the linear independence constraint qualification and the strict slackness condition.A set of second order sufficient conditions for the mathematical program with parameterized QVI constraints are proposed,which are demonstrated to be sufficient for the second order growth condition.The strongly BD-regularity for the nonsmooth system of equations at a solution point is demonstrated under the second order sufficient conditions.The smoothing Newton method in Qi-Sun-Zhou [2000] is employed to solve this nonsmooth system and the quadratic convergence is guaranteed by the strongly BD-regularity.Numerical experiments are reported to show that the smoothing Newton method is very effective for solving this class of optimization problems.