Optimal beamforming via interior point methods
✍ Scribed by Lebret, Hervé
- Publisher
- Springer
- Year
- 1996
- Tongue
- English
- Weight
- 898 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0922-5773
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In this paper, we propose an algorithm for solving non‐linear non‐convex programming problems, which is based on the interior point approach. Main theoretical results concern direction determination and step‐length selection. We split inequality constraints into active and inactive to o
Let be the set of stable linear time-invariant autonomous systems, equipped with a stability robustness measure . Let T A be the measure of the computational e ciency of the algorithm A that veriÿes the stability of the elements of . We demonstrate the existence of a robustness measure , algorithm A