AbstractIn this paper, we first investigate the invertibility of a class of matrices. Based on the obtained results, we then discuss the solvability of Newton equations appearing in the smoothing-type algorithm for solving the second-order cone complementarity problem (SOCCP). A condition ensuring the solvability of such a system of Newton equations is given. In addition, our results also show that the assumption that the Jacobian matrix of the function involved in the SOCCP is a P0-matrix is not enough for ensuring the solvability of such a system of Newton equations, which is different from the one of smoothing-type algorithms for solving many traditional optimization problems in ℜn
AbstractIn this paper, we present a new one-step smoothing Newton method proposed for solving the no...
AbstractThe affine second-order cone complementarity problem (SOCCP) is a wide class of problems tha...
AbstractWe consider an inverse problem arising from the semi-definite quadratic programming (SDQP) p...
AbstractIn this paper, we first investigate the invertibility of a class of matrices. Based on the o...
summary:In this paper we introduce a new smoothing function and show that it is coercive under suita...
summary:In this paper, we present a new one-step smoothing Newton method for solving the second-orde...
AbstractIn this paper, we propose a globally and quadratically convergent Newton-type algorithm for ...
AbstractThis paper deals with the second-order cone complementarity problem (SOCCP), which is an imp...
AbstractIn this article, we propose a new smoothing inexact Newton algorithm for solving nonlinear c...
2003-2004 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe
The Second-Order Cone Complementarity Problem (SOCCP) is a wide class of problems containing the Non...
The Second-Order Cone Complementarity Problem (SOCCP) is a wide class of problems, which includes th...
10.1023/A:1022996819381Computational Optimization and Applications251-339-56CPPP
We introduce basic ideas of a nonsmooth Newton’s method and its application in solving semidefinite ...
AbstractAnalogous to the nonlinear complementarity problem and the semi-definite complementarity pro...
AbstractIn this paper, we present a new one-step smoothing Newton method proposed for solving the no...
AbstractThe affine second-order cone complementarity problem (SOCCP) is a wide class of problems tha...
AbstractWe consider an inverse problem arising from the semi-definite quadratic programming (SDQP) p...
AbstractIn this paper, we first investigate the invertibility of a class of matrices. Based on the o...
summary:In this paper we introduce a new smoothing function and show that it is coercive under suita...
summary:In this paper, we present a new one-step smoothing Newton method for solving the second-orde...
AbstractIn this paper, we propose a globally and quadratically convergent Newton-type algorithm for ...
AbstractThis paper deals with the second-order cone complementarity problem (SOCCP), which is an imp...
AbstractIn this article, we propose a new smoothing inexact Newton algorithm for solving nonlinear c...
2003-2004 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe
The Second-Order Cone Complementarity Problem (SOCCP) is a wide class of problems containing the Non...
The Second-Order Cone Complementarity Problem (SOCCP) is a wide class of problems, which includes th...
10.1023/A:1022996819381Computational Optimization and Applications251-339-56CPPP
We introduce basic ideas of a nonsmooth Newton’s method and its application in solving semidefinite ...
AbstractAnalogous to the nonlinear complementarity problem and the semi-definite complementarity pro...
AbstractIn this paper, we present a new one-step smoothing Newton method proposed for solving the no...
AbstractThe affine second-order cone complementarity problem (SOCCP) is a wide class of problems tha...
AbstractWe consider an inverse problem arising from the semi-definite quadratic programming (SDQP) p...