Broyden–Fletcher–Goldfarb–Shanno算法
计算机科学
黑森矩阵
初始化
卷积神经网络
算法
计算
最优化问题
数学优化
人工智能
数学
应用数学
程序设计语言
异步通信
计算机网络
作者
Changyu Zhou,Xu Bai,Li Yi,Munawar Shah,Motoyuki Sato,Xiaohua Tong
标识
DOI:10.1109/jstars.2024.3357831
摘要
This article presents an optimization-based approach to overcome redundancy arising from the multivariables enumeration process in multiple signal classification (MUSIC). By incorporating Broyden–Fletcher–Goldfarb–Shanno (BFGS) optimization, the computational speed of the MUSIC algorithm is significantly improved while maintaining mathematical accuracy. The optimization techniques require reasonable initial values to start the iteration, while for single target imaging purposes, the initial values can be acquired by the boundary between the near field and the far field. To generate suitable initial values for the optimization, we employ a modified convolutional neural network (CNN) to approximate the boundaries between the near and far fields, which vary with array system properties. Besides, the proposed method introduces a method for the Hessian matrix and gradient initialization for the BFGS method. Using simulation results as training samples, the modified CNN successfully establishes boundary approximations. Simulation and experimentation confirm the feasibility of our proposed method, showing its advantages in both accuracy and computation speed compared to existing techniques.
科研通智能强力驱动
Strongly Powered by AbleSci AI