<p>The semi-infinite programming problem(SIP) is an optimization problem having an infinite number of inequality constrains and a finite number of variables. Since many important problems in the real world can be formulated in a natural manner as ...
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 many researchers. On the other hand, the simplex-type method for SOCP...
In this paper, we propose a new exchange method for solving convex semi-infinite programming problems (SIPs). The traditional exchange method solves a sequence of finitely relaxed subproblems, that is, subproblems with finitely many constraints ch...
JOURNAL OF GLOBAL OPTIMIZATION 60(1) 25-48 2014年9月 [査読有り]
The second-order cone program (SOCP) is an optimization problem with second-order cone (SOC) constraints and has achieved notable developments in the last decade. The classical semi-infinite program (SIP) is represented with infinitely many inequa...
nternational Conference on Nonlinear Analysis and Convex Analysis International Conference on Optimization Techniques and Applications 2019年8月25日 [招待有り]