Abstract
In this paper, an efficient algorithm is proposed for solving convex constrained equations. The method has the following characteristics: (i) its search direction satisfies the sufficient descent property which is independent of any line search conditions; (ii) the equations only satisfy pseudo-monotone property; (iii) its global convergence is proved without the Lipschitz continuity. We compare our numerical results for test problems with those of other derivative-free projection methods.
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.
