2000 character limit reached
A Newton-Fixed Point Homotopy Algorithm For Nonlinear Complementarity Problems With Generalized Monotonicity
Published 5 Jul 2012 in math.OC | (1207.1145v1)
Abstract: In this paper has been considered probability-one global convergence of NFPH (Newton-Fixed Point Homotopy) algorithm for system of nonlinear equations and has been proposed a probability-one homotopy algorithm to solve a regularized smoothing equation for NCP with generalized monotonicity. Our results provide a theoretical basis to develop a new computational method for nonlinear equation systems and complementarity problems. Some preliminary numerical experiments shows that our NFPH method is useful and promissing for difficult nonlinear problems.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.