Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme

摘要

This paper studies the cutting-plane approach for solving quadratic semi-infinite programming problems. Several relaxation techniques and their combinations are proposed and discussed. A flexible convergence proof is provided to cover different settings of a relaxation scheme. The implementation issues are addressed with some numerical experiments to illustrate the computational behavior of each different combination.