Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/23299
Title: A solution method for combined semi-infinite and semi-definite programming
Authors: Li, SJ
Yang, XQ 
Teo, KL
Wu, SY
Issue Date: 2004
Source: Anziam journal, 2004, v. 45, no. 4, p. 477-494 How to cite?
Journal: ANZIAM Journal 
Abstract: In this paper, we develop a discretisation algorithm with an adaptive scheme for solving a class of combined semi-infinite and semi-definite programming problems. We show that any sequence of points generated by the algorithm contains a convergent subsequence; and furthermore, each accumulation point is a local optimal solution of the combined semi-infinite and semi-definite programming problem. To illustrate the effectiveness of the algorithm, two specific classes of problems are solved. They are relaxations of quadratically constrained semi-infinite quadratic programming problems and semi-infinite eigenvalue problems.
URI: http://hdl.handle.net/10397/23299
ISSN: 1446-1811
DOI: 10.1017/S1446181100013511
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
0
Last month
0
Citations as of Sep 23, 2017

Page view(s)

42
Last Week
6
Last month
Checked on Sep 24, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.