Using K-T optimality condition of nonsmooth optimization, we establish two equivalent systems of the nonsmooth equations for the constrained minimax problem directly. Then generalized Newton methods are applied to so...Using K-T optimality condition of nonsmooth optimization, we establish two equivalent systems of the nonsmooth equations for the constrained minimax problem directly. Then generalized Newton methods are applied to solve these systems of the nonsmooth equations. Thus a new approach to solving the constrained minimax problem is developed.展开更多
Numerical methods for the solution of nonsmooth equations are studied. A new subdifferential for a locally Lipschitzian function is proposed. Based on this subdifferential, Newton methods for solving nonsmooth equatio...Numerical methods for the solution of nonsmooth equations are studied. A new subdifferential for a locally Lipschitzian function is proposed. Based on this subdifferential, Newton methods for solving nonsmooth equations are developed and their convergence is shown. Since this subdifferential is easy to be computed, the present Newton methods can be executed easily in some applications.展开更多
Newton-FOM （Full Orthogonalization Method ） algorithm and NewtonGMRES （Generalized Minimum Residual Method） algorithm for solving nonsmooth equations are presented. It is proved that these Krylov subspace algorith...Newton-FOM （Full Orthogonalization Method ） algorithm and NewtonGMRES （Generalized Minimum Residual Method） algorithm for solving nonsmooth equations are presented. It is proved that these Krylov subspace algorithms have the locally quadratic convergence. Numerical experiments demonstrate the effectiveness of the algorithms.展开更多
In this paper. we present a class of' embedding methods for nonsmooth equations. Under suitable conditions, we Prove that there exists a homotopy solution curve, which is Unique and continuous. We also prove that ...In this paper. we present a class of' embedding methods for nonsmooth equations. Under suitable conditions, we Prove that there exists a homotopy solution curve, which is Unique and continuous. We also prove that the solution curve is singlcvalue-d with respect to the homotopy parameter. Then we construct all efficient algorithm for this class of equations and prove its convcrgcnce. Filially, we apply the algorithm to the nonlinear complementarity problem. The numerical results show that tile algorithm is satisfacotry.展开更多
A new nonsmooth equations model of constrained minimax problem was de-rived. The generalized Newton method was applied for solving this system of nonsmooth equations system. A new algorithm for solving constrained min...A new nonsmooth equations model of constrained minimax problem was de-rived. The generalized Newton method was applied for solving this system of nonsmooth equations system. A new algorithm for solving constrained minimax problem was established. The local superlinear and quadratic convergences of the algorithm were discussed.展开更多
A parameter-self-adjusting Levenberg-Marquardt method （PSA-LMM） is proposed for solving a nonlinear system of equations F（x） = 0, where F ：R^n→R^n is a semismooth mapping. At each iteration, the LM parameter μk...A parameter-self-adjusting Levenberg-Marquardt method （PSA-LMM） is proposed for solving a nonlinear system of equations F（x） = 0, where F ：R^n→R^n is a semismooth mapping. At each iteration, the LM parameter μk is automatically adjusted based on the ratio between actual reduction and predicted reduction. The global convergence of PSA- LMM for solving semismooth equations is demonstrated. Under the BD-regular condition, we prove that PSA-LMM is locally superlinearly convergent for semismooth equations and locally quadratically convergent for strongly semismooth equations. Numerical results for solving nonlinear complementarity problems are presented.展开更多
Presents an analysis of the generalized Newton method, approximate Newton methods, and splitting methods for solving nonsmooth equations from Picard iteration viewpoint. Details of the radius of the weak Jacobian of P...Presents an analysis of the generalized Newton method, approximate Newton methods, and splitting methods for solving nonsmooth equations from Picard iteration viewpoint. Details of the radius of the weak Jacobian of Picard iteration function; Generalized Jacobian; Generalized Newton methods for piecewise equations.展开更多
In this paper, we establish an inexact parameterized Newton method for solving the B differentiable equations. By introducing a new concept, we prove the local and large range convergence of the method under some wea...In this paper, we establish an inexact parameterized Newton method for solving the B differentiable equations. By introducing a new concept, we prove the local and large range convergence of the method under some weaker assumptions. We have conducted some numerical experiments. The numerical results show that the method is effective.展开更多
文摘Using K-T optimality condition of nonsmooth optimization, we establish two equivalent systems of the nonsmooth equations for the constrained minimax problem directly. Then generalized Newton methods are applied to solve these systems of the nonsmooth equations. Thus a new approach to solving the constrained minimax problem is developed.
文摘Numerical methods for the solution of nonsmooth equations are studied. A new subdifferential for a locally Lipschitzian function is proposed. Based on this subdifferential, Newton methods for solving nonsmooth equations are developed and their convergence is shown. Since this subdifferential is easy to be computed, the present Newton methods can be executed easily in some applications.
文摘Newton-FOM （Full Orthogonalization Method ） algorithm and NewtonGMRES （Generalized Minimum Residual Method） algorithm for solving nonsmooth equations are presented. It is proved that these Krylov subspace algorithms have the locally quadratic convergence. Numerical experiments demonstrate the effectiveness of the algorithms.
文摘In this paper. we present a class of' embedding methods for nonsmooth equations. Under suitable conditions, we Prove that there exists a homotopy solution curve, which is Unique and continuous. We also prove that the solution curve is singlcvalue-d with respect to the homotopy parameter. Then we construct all efficient algorithm for this class of equations and prove its convcrgcnce. Filially, we apply the algorithm to the nonlinear complementarity problem. The numerical results show that tile algorithm is satisfacotry.
文摘A new nonsmooth equations model of constrained minimax problem was de-rived. The generalized Newton method was applied for solving this system of nonsmooth equations system. A new algorithm for solving constrained minimax problem was established. The local superlinear and quadratic convergences of the algorithm were discussed.
基金Acknowledgments. This work is supported by the National Natural Science Foundation of China under projects Nos. 11071029, 11101064 and 91130007 and speciMized Research Fund for the Doctoral Program of Higher Education （20110041120039）. We are grateful to the associate editor and anonymous referee＇s comments to improve the quality of the manuscript. The second author also appreciate the discussion with his student Miao Xiaonan.
文摘A parameter-self-adjusting Levenberg-Marquardt method （PSA-LMM） is proposed for solving a nonlinear system of equations F（x） = 0, where F ：R^n→R^n is a semismooth mapping. At each iteration, the LM parameter μk is automatically adjusted based on the ratio between actual reduction and predicted reduction. The global convergence of PSA- LMM for solving semismooth equations is demonstrated. Under the BD-regular condition, we prove that PSA-LMM is locally superlinearly convergent for semismooth equations and locally quadratically convergent for strongly semismooth equations. Numerical results for solving nonlinear complementarity problems are presented.
基金The research was partly supported by NNSFC(No. 19771047) and NSF of Jiangsu Province (BK97059 ).
文摘Presents an analysis of the generalized Newton method, approximate Newton methods, and splitting methods for solving nonsmooth equations from Picard iteration viewpoint. Details of the radius of the weak Jacobian of Picard iteration function; Generalized Jacobian; Generalized Newton methods for piecewise equations.
文摘In this paper, we establish an inexact parameterized Newton method for solving the B differentiable equations. By introducing a new concept, we prove the local and large range convergence of the method under some weaker assumptions. We have conducted some numerical experiments. The numerical results show that the method is effective.
