.png){kind=icon}
.png){kind=icon}
Return
Randomized Subspace Newton Convex Method Applied to Data-Driven Sensor Selection Problem
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2021.3050708.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The randomized subspace Newton convex methods for the sensor selection problem are proposed. The randomized subspace Newton algorithm is straightforwardly applied to the convex formulation, and the customized method in which the part of the update variables are selected to be the present best sensor candidates is also considered. In the converged solution, almost the same results are obtained by original and randomized-subspace-Newton convex methods. As expected, the randomized-subspace-Newton methods require more computational steps while they reduce the total amount of the computational time because the computational time for one step is significantly reduced by the cubic of the ratio of numbers of randomly updating variables to all the variables. The customized method shows superior performance to the straightforward implementation in terms of the quality of sensors and the computational time.
Keywords:
Convergence
Sparse matrices
Signal processing algorithms
Linear programming
Newton method
Heuristic algorithms
Computational efficiency
Randomized subspace Newton algorithm
convex sensor selection problem
data-driven sensor selection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W