A homotopy interior point method for semi-infinite programming problems (Q2385505): Difference between revisions

The article presents a homotopy method for the solution of standard semi-infinite programs (SIPs) with convex lower level problems. The main idea is to look at the combined stationarity conditions of the upper and lower level problems and solve the resulting degenerate equation by a homotopy approach. The homotopy path is shown to be a smooth curve which ends at a point that satisfies the combined stationarity conditions. This curve consists of interior points of its natural embedding set, but it should be pointed out that the corresponding decision variables are not necessarily interior points of the feasible set of SIP, as the title of the paper might suggest. Tracing the homotopy path numerically from a given starting point gives rise to a globally convergent algorithm for SIP. Some preliminary numerical results illustrate the presented approach.