Abstract
Extending our previous work [T. Wang, R. D. C. Monteiro, and J.-S. Pang, Math. Programming, 74 (1996), pp. 159--195], this paper presents a general potential reduction Newton method for solving a constrained system of nonlinear equations. A major convergence result for the method is established. Specializations of the method to a convex semidefinite program and a monotone complementarity problem in symmetric matrices are discussed. Strengthened convergence results are established in the context of these specializations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
