An Interior-Point Algorithm for Nonconvex Nonlinear Programming
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part II
MIMO transceiver design via majorization theory
Foundations and Trends in Communications and Information Theory
Antenna array synthesis with clusters of unmanned aerial vehicles
Automatica (Journal of IFAC)
Cutting-set methods for robust convex optimization with pessimizing oracles
Optimization Methods & Software
Optimal polarized beampattern synthesis using a vector antenna array
IEEE Transactions on Signal Processing
Array pattern synthesis via sparse weight vector finding and convex programming
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Journal of Approximation Theory
A neural network algorithm for second-order conic programming
ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part I
A second-order cone bounding algorithm for robust minimum variance beamforming
Switching and Learning in Feedback Systems
Power-Controlled directional medium access control for wireless mesh networks
EURO-NGI'05 Proceedings of the Second international conference on Wireless Systems and Network Architectures in Next Generation Internet
Mathematics and Computers in Simulation
International Journal of Bio-Inspired Computation
An alternating direction method for second-order conic programming
Computers and Operations Research
| Hi-index | 35.69 |
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great efficiency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on far- and near-field patterns over narrow or broad frequency bandwidth, and some important robustness constraints. We show several numerical simulations for the particular problem of constraining the beampattern level of a simple array for adaptive and broadband arrays