A logarithmic barrier cutting plane method for convex programming

A logarithmic barrier cutting plane method for convex programming

0.00 Avg rating0 Votes
Article ID: iaor1996335
Country: Switzerland
Volume: 58
Issue: 1
Start Page Number: 69
End Page Number: 98
Publication Date: Jul 1995
Journal: Annals of Operations Research
Authors: , , ,
Keywords: barrier function
Abstract:

The paper presents a logarithmic barrier cutting plane algorithm for convex (possibly non-smooth, semi-infinite) programming. Most cutting plane methods, like that of Kelley, and Cheney and Golstein, solve a linear approximation (localization) of the problem and then generate an additional cut to remove the linear program’s optimal point. Other methods, like the ‘central cutting’ plane methods of Elzinga-Moore and Goffin-Vial, calculate a center of the linear approximation and then adjust the level of the objective, or separate the current center from the feasible set. In contrast to these existing techniques the authors develop a method which does not solve the linear relaxations to optimality, but rather stays in the interior of the feasible set. The iterates follow the central path of a linear relaxation, until the current iterate either leaves the feasible set or is too close to the boundary. When this occurs, a new cut is generated and the algorithm iterates. The authors use the tools developed by den Hertog, Roos and Terlaky to analyze the effect of adding and deleting constraints in long-step logarithmic barrier methods for linear programming. Finally, implementation issues and computational results are presented. The test problems come from the class of numerically difficult convex geometric and semi-infinite programming problems.

Reviews

Required fields are marked *. Your email address will not be published.