Abstract
In this paper, the equivalence relation between a semi-infinite quadratically constrained convex quadratic programming problem and a combined semi-definite and semi-infinite programming problem is considered. Then, an efficient and reliable discretization algorithm for solving a general class of combined semi-definite and semi-infinite programming problems is developed. Both the continuous-time envelope-constrained optimal equalization filter and the corresponding robust envelope-constrained filter for a communication channel are solved by using the proposed algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 299-319 |
| Number of pages | 21 |
| Journal | Optimization and Engineering |
| Volume | 8 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Sept 2007 |
Keywords
- Combined semi-definite and semi-infinite programming
- Discretization algorithm
- Envelope constrained filter
- Robust envelope constrained filter
- Semi-infinite quadratically constrained convex quadratic programming
ASJC Scopus subject areas
- Software
- Civil and Structural Engineering
- Aerospace Engineering
- Mechanical Engineering
- Control and Optimization
- Electrical and Electronic Engineering