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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
