In this paper,we propose a regularized version of the generalized NCPfunction proposed by Hu,Huang and Chen[J.Comput.Appl.Math.,230(2009),pp.69–82].Based on this regularized function,we propose a semismooth Newton me...In this paper,we propose a regularized version of the generalized NCPfunction proposed by Hu,Huang and Chen[J.Comput.Appl.Math.,230(2009),pp.69–82].Based on this regularized function,we propose a semismooth Newton method for solving nonlinear complementarity problems,where a non-monotone line search scheme is used.In particular,we show that the proposed non-monotone method is globally and locally superlinearly convergent under suitable assumptions.We test the proposed method by solving the test problems from MCPLIB.Numerical experiments indicate that this algorithm has better numerical performance in the case of p=5 andθ∈[0.25,075]than other cases.展开更多
In this paper, we investigate a smoothing-type algorithm for solving the symmetric cone linear program ((SCLP) for short) by making use of an augmented system of its optimality conditions. The algorithm only needs...In this paper, we investigate a smoothing-type algorithm for solving the symmetric cone linear program ((SCLP) for short) by making use of an augmented system of its optimality conditions. The algorithm only needs to solve one system of linear equations and to perform one line search at each iteration. It is proved that the algorithm is globally convergent without assuming any prior knowledge of feasibility/infeasibility of the problem. In particular, the algorithm may correctly detect solvability of (SCLP). Furthermore, if (SCLP) has a solution, then the algorithm will generate a solution of (SCLP), and if the problem is strongly infeasible, the algorithm will correctly detect infeasibility of (SCLP).展开更多
文摘In this paper,we propose a regularized version of the generalized NCPfunction proposed by Hu,Huang and Chen[J.Comput.Appl.Math.,230(2009),pp.69–82].Based on this regularized function,we propose a semismooth Newton method for solving nonlinear complementarity problems,where a non-monotone line search scheme is used.In particular,we show that the proposed non-monotone method is globally and locally superlinearly convergent under suitable assumptions.We test the proposed method by solving the test problems from MCPLIB.Numerical experiments indicate that this algorithm has better numerical performance in the case of p=5 andθ∈[0.25,075]than other cases.
基金Supported by the National Natural Science Foundation of China(No.11171252,11301375 and 71301118)Research Fund for the Doctoral Program of Higher Education of China(No.20120032120076)Tianjin Planning Program of Philosophy and Social Science(No.TJTJ11-004)
文摘In this paper, we investigate a smoothing-type algorithm for solving the symmetric cone linear program ((SCLP) for short) by making use of an augmented system of its optimality conditions. The algorithm only needs to solve one system of linear equations and to perform one line search at each iteration. It is proved that the algorithm is globally convergent without assuming any prior knowledge of feasibility/infeasibility of the problem. In particular, the algorithm may correctly detect solvability of (SCLP). Furthermore, if (SCLP) has a solution, then the algorithm will generate a solution of (SCLP), and if the problem is strongly infeasible, the algorithm will correctly detect infeasibility of (SCLP).