In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space w...In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.展开更多
Naturally suited array geometry for 360° coverage is the uniform circular array (UCA). A comparison of two types of uniform circular array configurations is presented in this paper. Due to its symmetrical...Naturally suited array geometry for 360° coverage is the uniform circular array (UCA). A comparison of two types of uniform circular array configurations is presented in this paper. Due to its symmetrical geometry UCA is always targeted which results in minimal change inside lobe levels and beam width when scanned by a phased array antenna. Particle Swarm Optimization and Cuckoo algorithm are used for the calculation of complex weights of the array elements. Comparisons are drawn in the context of adaptive beam forming capabilities. Obtained results suggest that planar uniform circular array (9:10) using Cuckoo algorithm, has better beam forming properties with also reduced side lobe levels when compared to other geometry.展开更多
基金supported by the National Natural Science Foundation of China(11401126,71471140 and 11361018)Guangxi Natural Science Foundation(2016GXNSFBA380102 and 2014GXNSFFA118001)+2 种基金Guangxi Key Laboratory of Cryptography and Information Security(GCIS201618)Guangxi Key Laboratory of Automatic Detecting Technology and Instruments(YQ15112 and YQ16112)China
文摘In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.
文摘Naturally suited array geometry for 360° coverage is the uniform circular array (UCA). A comparison of two types of uniform circular array configurations is presented in this paper. Due to its symmetrical geometry UCA is always targeted which results in minimal change inside lobe levels and beam width when scanned by a phased array antenna. Particle Swarm Optimization and Cuckoo algorithm are used for the calculation of complex weights of the array elements. Comparisons are drawn in the context of adaptive beam forming capabilities. Obtained results suggest that planar uniform circular array (9:10) using Cuckoo algorithm, has better beam forming properties with also reduced side lobe levels when compared to other geometry.
