Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
Resource
Journal of Computational and Applied Mathematics 129 (1-2): 89-104
Journal
Journal of Computational and Applied Mathematics
Journal Volume
129
Journal Issue
1-2
Pages
89-104
Date Issued
2001
Author(s)
Abstract
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. © 2001 Elsevier Science B.V. All rights reserved.
Type
journal article