Abstract
A combined homotopy interior point method for solving general nonlinear programming is proposed. The algorithm generated by this method to Kuhn-Tucker points of the general nonlinear programming problems is proved to be globally convergent, under the “normal cone condition” about the constraints, probably without the convexity.
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.
