Paper Info
Title
An Approximation Approach to Non-strictly Convex Quadratic Semi-infinite Programming
Abstract
We present in this paper a numerical method for solving non-strictly-convex quadratic semi-infinite programming including linear semi-infinite programming. The proposed method transforms the problem into a series of strictly convex quadratic semi-infinite programming problems. Several convergence results and a numerical experiment are given.
Year
DOI
Venue
2004
10.1007/s10898-004-8278-8
J. Global Optimization
Keywords
DocType
Volume
Approximation,Convex quadratic semi-infinite programming,Duality,Linear semi-infinite programming
Journal
30
Issue
ISSN
Citations 
2-3
0925-5001
0
PageRank 
References 
Authors
0.34
2
3
Name
Order
Citations
PageRank
S. Ito100.34
Y. Liu2334.70
K. L. Teo31643211.47