2001 article

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

Fang, S. C., Lin, C. J., & Wu, S. Y. (2001, April 1). JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, Vol. 129, pp. 89–104.

By: S. Fang n, C. Lin* & S. Wu*

co-author countries: Taiwan, Province of China 🇹🇼 United States of America 🇺🇸
author keywords: semi-infinite programming; quadratic programming; relaxation; interior-point method
Source: Web Of Science
Added: August 6, 2018

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.