We define a new Newton-type method for the solution of constrained systems of equations and analyze in detail its properties. Under suitable conditions, that do not include differentiability or local uniqueness of solutions, the method converges locally quadratically to a solution of the system of equations, thus filling an important gap in the existing theory. The new algorithm improves on known methods and, when particularized to KKT systems deriving from optimality conditions for constrained optimization or variational inequalities, it has theoretical advantages even over methods specifically designed to solve such systems.
Citation
Mathematical Programming, DOI: 10.1007/s10107-013-0676-6, to appear