Abstract
In [1], an aggregate constraint aggregate (ACH) method for nonconvex nonlinear programming problems was presented and global convergence result was obtained when the feasible set is bounded and satisfies a weak normal cone condition with some standard constraint qualifications. In this paper, without assuming the boundedness of feasible set, the global convergence of ACH method is proven under a suitable additional assumption.
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.
