Abstract
We show, using elementary considerations, that a modified barrier function method for the solution of convex programming problems converges for any fixed positive setting of the barrier parameter. With mild conditions on the primal and dual feasible regions, we show how to use the modified barrier function method to obtain primal and dual optimal solutions, even in the presence of degeneracy. We illustrate the argument for convergence in the case of linear programming, and then generalize it to the convex programming case.
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.
