An iterative method for solving semismooth equations

DOI10.1016/S0377-0427(02)00413-2zbMath1018.65079MaRDI QIDQ697540

Liqun Qi, Xiaojiao Tong, Dong-hui Li

Publication date: 17 September 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

global convergenceNewton methodsuperlinear convergencetrust region methodsmoothing functionline search methodsemismooth equation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (1)

Smoothing SQP algorithm for semismooth equations with box constraints

Uses Software

• GQTPAR

Cites Work

• Unnamed Item
• Unnamed Item
• A smoothing Newton method for semi-infinite programming
• A nonsmooth version of Newton's method
• Computing a Trust Region Step
• Semismooth and Semiconvex Functions in Constrained Optimization
• A special newton-type optimization method
• Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
• A Trust Region Method for Solving Generalized Complementarity Problems
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Jacobian Smoothing Methods for Nonlinear Complementarity Problems
• Trust Region Algorithms for Solving Nonsmooth Equations

This page was built for publication: An iterative method for solving semismooth equations