Abstract
In the first part of the paper a logarithmic barrier method for solving convex semi-infinite programming problems with bounded solution set is considered. For that the solution of a non-differentiable optimization problem by means of a logarithmic barrier method is suggested. The arising auxiliary problems are solved, for instance, via a bundle method. In the second part of the paper a regularized logarithmic barrier method for solving convex semi-infinite problems with unbounded solution set is considered, which is based on the method from the first part. The properties and the behaviour of the presented methods are studied and numerical results are given.
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.
