Research Article  Open Access
Matthew Hawes, Wei Liu, "Design of Fixed Beamformers Based on VectorSensor Arrays", International Journal of Antennas and Propagation, vol. 2015, Article ID 181937, 9 pages, 2015. https://doi.org/10.1155/2015/181937
Design of Fixed Beamformers Based on VectorSensor Arrays
Abstract
Vectorsensor arrays such as those composed of crossed dipole pairs are used as they can account for a signal’s polarisation in addition to the usual direction of arrival information, hence allowing expanded capacity of the system. The problem of designing fixed beamformers based on such an array, with a quaternionic signal model, is considered in this paper. Firstly, we consider the problem of designing the weight coefficients for a fixed set of vectorsensor locations. This can be achieved by minimising the sidelobe levels while keeping a unitary response for the main lobe. The second problem is then how to find a sparse set of sensor locations which can be efficiently used to implement a fixed beamformer. We propose solving this problem by converting the traditional norm minimisation associated with compressive sensing into a modified norm minimisation which simultaneously minimises all four parts of the quaternionic weight coefficients. Further improvements can be made in terms of sparsity by converting the problem into a series of iteratively solved reweighted minimisations, as well as being able to enforce a minimum spacing between active sensor locations. Design examples are provided to verify the effectiveness of the proposed design methods.
1. Introduction
Traditionally fixed beamformers have been designed assuming the arrays consist of isotropic array elements [1, 2]. As a result the polarisation of a signal is not taken into account when considering the performance of an array. Instead, a vectorsensor array can be considered, allowing measurements of both the horizontal and vertical components of the received waveforms [3–14].
In the past ten years, quaternionvalued signal processing has attracted more and more attention with application areas involving three or fourdimensional signals [15], and a quaternionic signal model has been introduced into the field of vectorsensor arrays for both adaptive beamforming and direction of arrival (DOA) estimation, [6, 7, 9–11, 13, 16, 17]. A quaternionic formulation provides a compact and convenient representation of three and fourdimensional signals, although there will not be improvement in performance in theory as equivalent formulations can be established in corresponding domains, that is, two realvalued numbers versus one complexvalued number, or four realvalued numbers (using a “long vector”) versus one quaternionvalued number. However, to the best of our knowledge the area of fixed beamformer design for vectorsensor arrays using such a signal model has not been considered yet (in particular, it would be the first time to address the problem of designing sparse vectorsensor arrays).
If such a beamformer is to be implemented using a uniform linear array (ULA), it is well known that the adjacent sensor separation can be no larger than half the operating wavelength, in order to avoid grating lobes. This can be problematic when considering arrays with a large aperture size, due to the cost associated with the number of sensors required. As a result, sparse arrays become a desirable alternative [18], which allow separations to be greater than half a wavelength, while still avoiding grating lobes due to the randomness of sensor locations. However, the tradeoff in using sparse arrays is the unpredictable sidelobe behaviour and it is often necessary to optimise sensor locations in order to achieve a desired performance, (e.g., minimising the peak sidelobe level).
Therefore, the second problem to consider when designing a fixed beamformer is how to find a sparse set of sensor locations that can be efficiently used to implement a desired fixed beamformer. Some nonlinear optimisation methods such as genetic algorithms (GAs) [19–23] and simulated annealing (SA) [24] have been regularly used to achieve the required location optimisation for sensor arrays. The disadvantage of these methods is the potentially long computation time and the possibility of convergence to a nonoptimal solution.
More recently, the area of compressive sensing (CS) has been explored [25], and CSbased methods have been proposed in the design of sparse arrays [26–32] through norm minimisation. It is also known that the sparsity of the final array can be improved by converting the problem into a series of iteratively reweighted minimisations [31–35]. This is achieved by the addition of a reweighting term which penalises small weight coefficients more heavily, meaning they are less likely to be repeated in the next iteration. In this paper we propose extending these schemes so that they can be used in designing a sparse set of vectorsensor locations with a quaternionic signal model. This is achieved by reformulating the problem into a modified norm minimisation similar to what is used for complexvalued minimisation schemes [36] and it can readily be solved using existing convex optimisation toolboxes [37, 38].
A third problem considered in this work is how to enforce a minimum spacing between active locations so that the vectorsensors with a nonzero physical size can fit into the resultant locations in practice. This is an extension of the work in [31], where a size constraint is employed for the design of traditional sparse scalarsensor arrays.
The rest of this paper is structured as follows: Section 2 gives details of the proposed design method, including some basics about quaternions (Section 2.1), the array model being used (Section 2.2), the method to find the weight coefficients for a fixed set of locations (Section 2.3), the quaternionic CSbased (Section 2.4) and quaternionic reweighted minimisation based (Section 2.5) design methods, and methods of enforcing the size constraint (Section 2.6). Design examples are given in Section 3, with conclusions drawn in Section 4.
2. Proposed Design Method
2.1. Quaternions
A quaternion is a hypercomplex number defined as follows [39]: where is the real part of the quaternion and , , and are the three imaginary components. Similarly for vectors and matrices of quaternions we have
The conjugate and modulus of a quaternion are given by The imaginary units , , and satisfy the following:
Finally denotes the conjugate transpose of quaternionic vectors and matrices.
It is worth noting that in many scenarios quaternions prove useful as they allow the easy representation of problems with fourdimensional data. However, care has to be taken when formulating a problem using quaternions as they are noncommutative.
2.2. Quaternionic Array Model
Figure 1 shows the array structure being considered. There are potentially active crossed dipole pairs located along the axis, uniformly spaced a distance apart. At each location one of the dipoles is parallel to the axis and the other to the axis. Also shown is a signal with its direction of arrival (DOA) defined by the angles and . Without loss of generality, we assume the signals impinge upon the array from the  plane; that is, or . The angle is limited to . A planewave signal model is considered; that is, the signal impinges upon the array from the far field.
The spatial steering vector of the array is given by where is the wavelength of the signal of interest and denotes the transpose operation.
For crossed dipoles the spatialpolarization coherent vector contains information about a signals polarisation and is given by [3–5, 11] where is the auxiliary polarization angle and is the polarization phase difference.
Now the array structure can be split into two subarrays, that is, one parallel to the axis and one to axis. The steering vector of each of these subarrays is complexvalued and given byThese are then combined to give an overall quaternionic steering vector as follows:
The response of the array is given bywhere is the quaternionic weight coefficient vector defined as and is a quaternionic value for .
2.3. Weight Vector Design for a Fixed Set of Locations
The first problem we consider here is that of designing the weight coefficients for a given array geometry, where the sensor locations could be that of a ULA or a known sparse structure or other layouts.
In order to achieve a desirable response (or reference response) , we can minimize the error between the designed and desired responses subject to a set of linear constraints to meet any specific requirements of the design, which can be formulated as follows:where denotes the norm, is the number of points sampled in the desired beam response, is the constraint matrix, and is the corresponding response vector.
In this work, we use the ideal response for , that is, a value of one for the main lobe and zeros for the other entries. Here we consider a special case of the above formulation, where we only minimize the design error over the sidelobe region and the designed response is constrained to be unity at the main lobe region. In this case, we havewhere and will only cover the sidelobe region, is constructed in a similar manner to but only considers the main lobe of interest, and is a vector with a value of unity for all its entries.
To convert the problem into a form that can easily be solved, the quaternionic values have to be split into real and imaginary parts that can be considered separately. This gives the problem in the following form:where the following definitions are used:where is the th row vector of the matrix and is constructed in a similar way to but only using the main lobe.
As mentioned this design method can be used with any known array geometry. However, in many cases, the array geometry is not known in advance and a location optimisation process is needed to find the set of array sensor locations, such as in the sparse array design problem, which will be dealt with in the next subsection.
2.4. CSBased Design of Sparse VectorSensor Arrays
As before, suppose is a reference pattern which we wish to achieve. First, consider Figure 1 as being a grid of potentially active crossed dipole locations. In this instance, is the aperture of the array and is a large number. Sparseness is then introduced by selecting the weight coefficients to give as few active crossed dipoles as possible, while still giving a designed response that is close to the desired one.
This problem is formulated aswhere is the number of nonzero weight coefficients in , is the vector holding the desired beam response at the sampled angular and polarisation points of interest, is the matrix composed of the corresponding steering vectors, and places a limit on the allowed difference between the desired and the designed responses.
In practice, (16) is approximated by a minimisation of the norm of the weight coefficients [25]; that is,
This formulation is effective for the design of narrowband sparse scalarsensor arrays. When considering quaternionic coefficients the problem has to be reformulated to ensure the real and three imaginary parts of the quaternion are simultaneously minimised. This is achieved by following a scheme similar to that used when considering the minimisation of complex data [36]. When all four parts of a quaternionic coefficient are equal to zero, the crossed dipoles can be considered inactive/not present, and as a result sparsity is introduced.
First we rewrite (17) aswhere
Now we decompose to , . In vector form, we haveThen (18) can be rewritten as
Now define
Finally we arrive at the final formulation for the sparse vectorsensor array design problem
2.5. Iteratively Solved Reweighted Quaternionic Minimisations
For the design of sparse arrays consisting of isotropic array elements with realvalued coefficients, reweighted minimisations are used in order to get a closer approximation to the minimisation [31, 34, 35]. This is done by solving a series of reweighted minimisations, where the reweighting term penalises smaller weight coefficients more heavily.
Following the idea, we introduce a reweighting parameter to each quaternionic coefficient. This leads to (23) being altered towhere we now havewith being set to slightly below the minimum implemented absolute coefficient value for a given location.
The problem is iteratively solved as follows.(1)Set and obtain an initial estimate of the weight coefficients by solving (23).(2)Consider ; find the reweighting terms for all and solve (24).(3)Repeat step 2 until the number of active sensor locations has remained constant for three or more iterations of the algorithm.
Note that it is the addition of the reweighting term that improves the sparsity of the solution. If a small nonzero valued combined weight coefficient is found in the previous iteration, it results in a large reweighting term in the current iteration. As a result the nonzero value is unlikely to be repeated, therefore improving the sparsity of the solution. Conversely, a large nonzero valued coefficient will give a small reweighting term. As a result the large nonzero value is likely to be repeated.
2.6. Enforcing the Physical Size Constraint
In above formulations, the solutions do not take the size of the vectorsensors into account. As a result we could end up with an array that could not be implemented in practice due to the vectorsensors not fitting in their deigned locations. Therefore, a minimum spacing of the vectorsensors’ physical size should be applied to the optimisation.
This can be achieved using the methods recently proposed in [31], where the postprocessing method and iterative minimum distance sampling method can be directly applied to our sparse vectorsensor array design. These two methods involve some degree of merging locations that are too close together. This is a form of steering vector error that may degrade the performance of the array. As a result, a constraint is required on the minimisation to limit the effects of this error, given by limiting to a small value in the design, where is the limit on the expected normbounded steering vector error, as normally employed in the design of robust beamformers. To further improve the performance of the array, the weight vector for the final sensor location can be redesigned using the method proposed in Section 2.3.
A third method to enforce the size constraint is to alter the reweighting scheme so that all locations not meeting the size constraint are heavily penalised in order to avoid replication in the next iteration. The modified reweighting terms are given by
The iterative procedure detailed in Section 2.5 is now also repeated until a solution complying with the size constraint is met (rather than looking at how many iterations the number of nonzero valued coefficients has remained constant for).
3. Design Examples
In this section design examples will be presented in order to verify the effectiveness of the proposed design methods. This will include one design example based on a ULA and one example to illustrate how the methods can be used to design a sparse vectorsensor array and how the reweighted method can improve the sparsity of the solution. Finally, an example will be given to illustrate the performance of arrays designed while enforcing a size constraint.
For all of the figures that follow, positive values of indicate the value range for , while negative values of indicate an equivalent range of with . The main lobe is designed to be at the single point defined by and , with the sidelobes given by for and .
3.1. ULA Based Design Example
First we consider a ULA consisting of ten crossed dipoles with an adjacent separation of . Both here and in all that follows, is the wavelength of the signal of interest. The polarisations are given by . By solving (14) to obtain the weight coefficients we end up with the response shown in Figure 2. It can be clearly seen that the main lobe is in the correct location and sufficient sidelobe attenuation has been achieved; that is, the minimisation has successfully designed a fixed beamformer.
3.2. Sparse Location Optimisation Design Examples
Now we will consider using the nonreweighted and reweighted minimisations to design sets of sparse locations. In this instance the maximum aperture of the array is and the polarisation of the signal of interest is defined by .
Firstly, (23) is solved with a value . However, this resulted in 44 active locations over an aperture of , giving a mean adjacent sensor separation of . As a result, a ULA of equivalent length could be implemented using a smaller number of crossed dipoles. Therefore, there is no saving in cost and so forth.
By increasing the value of to 0.94, the designed array instead has 9 active locations over an aperture of , giving a mean adjacent separation of . Therefore, less sensors are required than an equivalent length ULA. On the other hand, as the value of has been significantly increased there will be more error between the desired and designed responses than the case with . The responses for both cases are shown in Figure 3. This clearly shows the degradation in the performance of the array response. The main lobe width has been widened and the sidelobe levels raised. For completeness the locations found for the value of are shown in Table 1.

As an alternative, we can iteratively solve the series of reweighted minimisations given by (24) while using all the original parameters. So there is no increase in the value of and we still use , which suggests there should not be degradation in the performance of the array’s response. This results in 13 active locations spread over an aperture of as detailed in Table 2. Here the mean adjacent separation is , meaning the array can be implemented with fewer crossed dipoles than a ULA of equivalent length. Figure 4 shows the resulting response and it is clear that an acceptable performance has been achieved.

3.3. Design Examples with Size Constraint
Two examples will now be considered to show the effectiveness of two methods for enforcing the size constraint. For both, the size of the crossed dipoles being considered is assumed to be .
3.3.1. Postprocessing Design Example
For this example we consider an aperture of split into 300 potential sensor locations. In this instance the polarisation of the signal of interest is given by . The values of , , and were used in the constraints placed on the minimisation.
This resulted in 15 crossed dipoles spread over as shown in Table 3. Here the minimum adjacent separation is indicating that the size constraint has been successfully enforced. The resulting response is shown in Figure 5 which shows a desirable response has been achieved.

In order to ensure an acceptable performance here we had to redesign the weight coefficients for the final merged locations. It is reasonable to expect the same from the iterative minimum distance sampling method due to the fact that some merger of location is still required. A similar performance would also be achieved and as a result an example of it is not given here. However, a reweighted design example with size constraint is considered below as an alternative that does not require a redesigning of weight coefficients due to no locations being merged.
3.3.2. Reweighted Design Example
In this example we are now considering 600 possible locations over the same aperture. However, due to the improved sparsity for a given amount of error offered by the reweighted method we can now use a value of .
This results in 14 crossed dipole locations shown in Table 4. In this instance the aperture of the designed array is with a minimum adjacent separation of . Again, from Figure 6 we can see that an acceptable response has been achieved.

4. Conclusions
In this paper the problem of designing fixed beamformers based on vectorsensor arrays (with a quaternionic formulation for compact and convenient representation) has been considered. This problem can be split into two parts: first, designing the coefficients for a fixed set of vectorsensor locations and, second, finding a set of sparse locations that can be used to more efficiently implement a fixed beamformer.
The first part of the problem can be solved by minimising the sidelobe levels in the response while keeping a unitary response at the main lobe. For the second part of the problem a reformulation of the traditional norm minimisation into a modified norm minimisataion has been proposed. This is required in order to convert the problem into a form that can be solved, while still ensuring that all four parts of the quaternionic weight coefficients are simultaneously minimised. It is also possible to further improve the performance of the proposed method by converting the problem into a series of iteratively reweighted minimisations, as well as enforcing a minimum spacing of the physical size of the sensors being considered. Design examples have been provided to verify the effectiveness of the proposed design methods.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
References
 H. L. van Trees, Optimum Array Processing: Part IV of Detection, Estimation, and Modulation Theory, John Wiley & Sons, New York, NY, USA, 2002.
 W. Liu and S. Weiss, Wideband Beamforming: Concepts and Techniqeus, John Wiley & Sons, Chichester, UK, 2010.
 R. T. Compton Jr., “On the performance of a polarization sensitive adaptive array,” IEEE Transactions on Antennas and Propagation, vol. 29, no. 5, pp. 718–725, 1981. View at: Google Scholar
 J. Li and R. T. Compton Jr., “Angle and polarization estimation using ESPRIT with a polarization sensitive array,” IEEE Transactions on Antennas and Propagation, vol. 39, no. 9, pp. 1376–1383, 1991. View at: Publisher Site  Google Scholar
 D. B. Williams and V. Madisetti, Eds., Digital Signal Processing Handbook, CRC Press, Boca Raton, Fla, USA, 1st edition, 1997.
 S. Miron, N. le Bihan, and J. I. Mars, “High resolution vectorsensor array processing using quaternions,” in Proceedings of the IEEE/SP 13th Workshop on Statistical Signal Processing, pp. 918–923, July 2005. View at: Google Scholar
 S. Miron, N. le Bihan, and J. I. Mars, “Quaternionmusic for vectorsensor array processing,” IEEE Transactions on Signal Processing, vol. 54, no. 4, pp. 1218–1229, 2006. View at: Publisher Site  Google Scholar
 J.J. Xiao and A. Nehorai, “Optimal polarized beampattern synthesis using a vector antenna array,” IEEE Transactions on Signal Processing, vol. 57, no. 2, pp. 576–587, 2009. View at: Publisher Site  Google Scholar  MathSciNet
 X. Gou, Y. Xu, Z. Liu, and X. Gong, “Quaternioncapon beamformer using crosseddipole arrays,” in Proceedings of the IEEE International Symposium on Microwave, Antenna, Propagation, and EMC Technologies for Wireless Communications (MAPE '11), pp. 34–37, November 2011. View at: Publisher Site  Google Scholar
 J. W. Tao and W. X. Chang, “A novel combined beamformer based on hypercomplex processes,” IEEE Transactions on Aerospace and Electronic Systems, vol. 49, no. 2, pp. 1276–1289, 2013. View at: Publisher Site  Google Scholar
 X. R. Zhang, W. Liu, Y. G. Xu, and Z. W. Liu, “Quaternionvalued robust adaptive beamformer for electromagnetic vectorsensor arrays with worstcase constraint,” Signal Processing, vol. 104, pp. 274–283, 2014. View at: Publisher Site  Google Scholar
 X. Zhang, Z. Liu, Y. Xu, and W. Liu, “Adaptive tensorial beamformer based on electromagnetic vectorsensor arrays with coherent interferences,” Multidimensional Systems and Signal Processing, 2014. View at: Publisher Site  Google Scholar
 J. W. Tao and W. X. Chang, “Adaptive beamforming based on complex quaternion processes,” Mathematical Problems in Engineering, vol. 2014, Article ID 291249, 10 pages, 2014. View at: Publisher Site  Google Scholar
 W. Liu, “Antenna array signal processing for a quaternionvalued wireless communication system,” in Proceedings of the Benjamin Franklin Symposium on Microwave and Antenna Subsystems (BenMAS '14), Philadelphia, Pa, USA, September 2014. View at: Google Scholar
 N. L. Bihan and J. Mars, “Singular value decomposition of quaternion matrices: a new tool for vectorsensor signal processing,” Signal Processing, vol. 84, no. 7, pp. 1177–1199, 2004. View at: Publisher Site  Google Scholar
 M. Jiang, W. Liu, and Y. Li, “A general quaternionvalued gradient operator and its applications to computational fluid dynamics and adaptive beamforming,” in Proceedings of the International Conference on Digital Signal Processing (DSP '14), pp. 821–826, Hong Kong, August 2014. View at: Publisher Site  Google Scholar
 M. D. Jiang, Y. Li, and W. Liu, “Properties and applications of a restricted HR gradient operator,” http://arxiv.org/abs/1407.5178. View at: Google Scholar
 P. Jarske, T. Saramaki, S. K. Mitra, and Y. Neuvo, “On properties and design of nonuniformly spaced linear arrays,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 36, no. 3, pp. 372–380, 1988. View at: Publisher Site  Google Scholar
 R. L. Haupt, “Thinned arrays using genetic algorithms,” IEEE Transactions on Antennas and Propagation, vol. 42, no. 7, pp. 993–999, 1994. View at: Publisher Site  Google Scholar
 K.K. Yan and Y. Lu, “Sidelobe reduction in arraypattern synthesis using genetic algorithm,” IEEE Transactions on Antennas and Propagation, vol. 45, no. 7, pp. 1117–1122, 1997. View at: Publisher Site  Google Scholar
 K. Chen, Z. He, and C. Han, “Design of 2dimension sparse arrays using an improved genetic algorithm,” in Proceedings of the 4th IEEE Workshop on Sensor Array and Multichannel Processing, pp. 209–213, Waltham, Mass, USA, July 2006. View at: Publisher Site  Google Scholar
 L. Cen, W. Ser, Z. L. Yu, and S. Rahardja, “An improved genetic algorithm for aperiodic array synthesis,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '08), pp. 2465–2468, April 2008. View at: Publisher Site  Google Scholar
 M. B. Hawes and W. Liu, “Location optimization of robust sparse antenna arrays with physical size constraint,” IEEE Antennas and Wireless Propagation Letters, vol. 11, pp. 1303–1306, 2012. View at: Publisher Site  Google Scholar
 A. Trucco and V. Murino, “Stochastic optimization of linear sparse arrays,” IEEE Journal of Oceanic Engineering, vol. 24, no. 3, pp. 291–299, 1999. View at: Publisher Site  Google Scholar
 E. J. Candes, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,” IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 489–509, 2006. View at: Publisher Site  Google Scholar  MathSciNet
 L. Li, W. Zhang, and F. Li, “The design of sparse antenna array,” http://arxiv.org/abs/0811.0705. View at: Google Scholar
 G. Prisco and M. D'Urso, “Exploiting compressive sensing theory in the design of sparse arrays,” in Proceedings of the IEEE Radar Conference, pp. 865–867, May 2011. View at: Publisher Site  Google Scholar
 L. Carin, “On the relationship between compressive sensing and random sensor arrays,” IEEE Antennas and Propagation Magazine, vol. 51, no. 5, pp. 72–81, 2009. View at: Publisher Site  Google Scholar
 G. Oliveri and A. Massa, “Bayesian compressive sampling for pattern synthesis with maximally sparse nonuniform linear arrays,” IEEE Transactions on Antennas and Propagation, vol. 59, no. 2, pp. 467–481, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 G. Oliveri, M. Carlin, and A. Massa, “Complexweight sparse linear array synthesis by Bayesian compressive sampling,” IEEE Transactions on Antennas and Propagation, vol. 60, no. 5, pp. 2309–2326, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 M. B. Hawes and W. Liu, “Compressive sensingbased approach to the design of linear robust sparse antenna arrays with physical size constraint,” IET Microwaves, Antennas & Propagation, vol. 8, no. 10, pp. 736–746, 2014. View at: Publisher Site  Google Scholar
 M. B. Hawes and W. Liu, “Sparse array design for wideband beamforming with reduced complexity in tapped delaylines,” IEEE/ACM Transactions on Audio, Speech, and Language Processing, vol. 22, no. 8, pp. 1236–1247, 2014. View at: Publisher Site  Google Scholar
 E. J. Candes, M. B. Wakin, and S. P. Boyd, “Enhancing sparsity by reweighted ${l}_{1}$ minimization,” Journal of Fourier Analysis and Applications, vol. 14, no. 56, pp. 877–905, 2008. View at: Publisher Site  Google Scholar
 B. Fuchs, “Synthesis of sparse arrays with focused or shaped beampattern via sequential convex optimizations,” IEEE Transactions on Antennas and Propagation, vol. 60, no. 7, pp. 3499–3503, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 G. Prisco and M. D'Urso, “Maximally sparse arrays via sequential convex optimizations,” IEEE Antennas and Wireless Propagation Letters, vol. 11, pp. 192–195, 2012. View at: Publisher Site  Google Scholar
 S. Winter, H. Sawada, and S. Makino, “On real and complex valued ${l}_{1}$norm minimization for overcomplete blind source separation,” in Proceedings of the IEEE Workshop on Applications of Signal Processing to Audio and Acoustics, pp. 86–89, Piscataway, NJ, USA, October 2005. View at: Google Scholar
 CVX Research, “CVX: Matlab software for disciplined convex programming,” Version 2.0 beta, 2012, http://cvxr.com/cvx. View at: Google Scholar
 M. C. Grant and S. P. Boyd, “Graph implementations for nonsmooth convex programs,” in Recent Advances in Learning and Control, V. Blondel, S. Boyd, and H. Kimura, Eds., vol. 371 of Lecture Notes in Control and Information Sciences, pp. 95–110, Springer, Berlin, Germany, 2008. View at: Publisher Site  Google Scholar  MathSciNet
 I. L. Kantor, A. S. Solodovnikov, and A. Shenitzer, Hypercomplex Numbers: An Elementary Introduction to Algebras, Springer, New York, NY, USA, 1989. View at: MathSciNet
Copyright
Copyright © 2015 Matthew Hawes and Wei Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.