Abstract
This paper continues the study commenced in [1] and [2], where we consider iterative procedures, finding stationary points of smooth functions on a class of nonconvex sets. We generalize the Newton method applied for the solution of convex programming problems for the case, when constraints are represented as a set-theoretical difference of a convex set and a union of several convex sets. We formulate and prove a proposition on the convergence of the algorithm.
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.
