Abstract
In this paper, we present a new interior point method—combined homotopy interior point method (CHIP method) for convex nonlinear programming. Without strict convexity of the logarithmic barrier function and boundedness and nonemptiness of the solution set, we prove that for any ϵ > 0, an ϵ-solution of the problem can be obtained by the CHIP method. To our knowledge, strict convexity of the logarithmic barrier function and nonemptiness and boundedness of the solution set are the essential assumptions of the well-known center path-following method. Therefore, the CHIP method essentially reduces the assumptions of the center path-following method and can be applied to more general problems.
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.
