Search Results for author:
Found 12 papers, 3 papers with code
Joint Sparse Estimation with Cardinality Constraint via Mixed-Integer Semidefinite Programming
To further reduce the computation time in such scenarios, a relaxation-based approach can be employed to obtain an approximate solution of the MISDP reformulation, at the expense of a reduced estimation performance.
Three more Decades in Array Signal Processing Research: An Optimization and Structure Exploitation Perspective
Inspired by the seminal review paper Two Decades of Array Signal Processing Research: The Parametric Approach by Krim and Viberg published in the IEEE Signal Processing Magazine, we are looking back at another three decades in Array Signal Processing Research under the classical narrowband array processing model based on second order statistics.
Decentralized Eigendecomposition for Online Learning over Graphs with Applications
Then, we investigate the online computation of the spectra of the graph Laplacian that is important in, e. g., Graph Fourier Analysis and graph dependent filter design.
Coordinated Sum-Rate Maximization in Multicell MU-MIMO with Deep Unrolling
Coordinated weighted sum-rate maximization in multicell MIMO networks with intra- and intercell interference and local channel state at the base stations is recognized as an important yet difficult problem.
Ambiguities in Direction-of-Arrival Estimation with Linear Arrays
Our approach uses Young tableaux for which a submatrix of the steering matrix has a vanishing determinant, which can be expressed through vanishing sums of unit roots.
Extended Successive Convex Approximation for Phase Retrieval with Dictionary Learning
The second algorithm, referred to as SCAphase, uses auxiliary variables and is favorable in the case of highly diverse mixture models.
Recovery under Side Constraints
Finally, we address the measurement system design for linear and nonlinear measurements of sparse signals.
Probability of Resolution of MUSIC and g-MUSIC: An Asymptotic Approach
Furthermore, this CLT is used to provide an accurate prediction of the resolution capabilities of the MUSIC and the g-MUSIC DoA estimation method.
Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
Interestingly, when the approximation subproblem is solved by a descent algorithm, convergence of a subsequence to a stationary point is still guaranteed even if the approximation subproblem is solved inexactly by terminating the descent algorithm after a finite number of iterations.
Successive Convex Approximation Algorithms for Sparse Signal Estimation with Nonconvex Regularizations
The proposed framework has several attractive features, namely, i) flexibility, as different choices of the approximate function lead to different type of algorithms; ii) fast convergence, as the problem structure can be better exploited by a proper choice of the approximate function and the stepsize is calculated by the line search; iii) low complexity, as the approximate function is convex and the line search scheme is carried out over a differentiable function; iv) guaranteed convergence to a stationary point.
A Parallel Best-Response Algorithm with Exact Line Search for Nonconvex Sparsity-Regularized Rank Minimization
In this paper, we propose a convergent parallel best-response algorithm with the exact line search for the nondifferentiable nonconvex sparsity-regularized rank minimization problem.
A Unified Successive Pseudo-Convex Approximation Framework
In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems.
Optimization and Control Numerical Analysis
