This paper provides a review of numerical methods for the solution of smooth semi-infinite
programming problems. Fundamental and partly new results on level sets, discretization …

This paper presents an state-of-the-art survey on linear semi-infinite programming theory
and its extensions (in particular, convex semi-infinite programming). This review updates a …

Let A be an s-sparse Hermitian matrix, f (x) be a univariate function, and i, j be two indices. In
this work, we investigate the query complexity of approximating if (A) j. We show that for any …

In this paper we propose a new exchange method for solving convex semi-infinite
programming (CSIP) problems. We introduce a new dropping-rule in the proposed …

In this paper, we consider a nonlinear semi-infinite program that minimizes a function
including a log-determinant (logdet) function over positive definite matrix constraints and …

In this paper, we study a semi-infinite programming (SIP) problem with a convex set
constraint. Using the value function of the lower level problem, we reformulate SIP problem …

One of the major computational tasks of using the traditional cutting plane approach to solve
linear semi-infinite programming problems lies in finding a global optimizer of a nonlinear …

This paper studies the cutting-plane approach for solving quadratic semi-infinite
programming problems. Several relaxation techniques and their combinations are proposed …

To solve the (linear) second-order cone programmes (SOCPs), the primal–dual interior-point
method has been studied extensively so far and said to be the most efficient method by …

In this paper, we propose an “inexact solution” approach to deal with linear semi-infinite
programming problems with finitely many variables and infinitely many constraints over a …