A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Interior-Point Methods in l 1 Optimal Sparse Representation Algorithms for Harmonic Retrieval
Abstract Atomic decomposition is an alternative method for frequency detection in harmonic signals. This type of method produces very concentrated solutions with few nonzero components. It can be used as an alternative to traditional approaches, such as, principal-components frequency estimation methods. In this paper, we consider the basis pursuit principle to find the representation (frequency) coefficients of a harmonic signal by minimizing the l 1 norm. For the l 1 minimization, we compare two interior-point methods. A primal-dual method, which consists of the perturbed optimality conditions of the linear program, results in solutions that are more accurate and sparse than using a primal (affine scaling) method to solve the same linear program. We contrast the solutions obtained by the interior-point methods using the size of the given data and a bound for perfect recovery of the harmonic signals to establish the better performance of the primal-dual method. In addition, experimental results are shown.
Interior-Point Methods in l 1 Optimal Sparse Representation Algorithms for Harmonic Retrieval
Abstract Atomic decomposition is an alternative method for frequency detection in harmonic signals. This type of method produces very concentrated solutions with few nonzero components. It can be used as an alternative to traditional approaches, such as, principal-components frequency estimation methods. In this paper, we consider the basis pursuit principle to find the representation (frequency) coefficients of a harmonic signal by minimizing the l 1 norm. For the l 1 minimization, we compare two interior-point methods. A primal-dual method, which consists of the perturbed optimality conditions of the linear program, results in solutions that are more accurate and sparse than using a primal (affine scaling) method to solve the same linear program. We contrast the solutions obtained by the interior-point methods using the size of the given data and a bound for perfect recovery of the harmonic signals to establish the better performance of the primal-dual method. In addition, experimental results are shown.
Interior-Point Methods in l 1 Optimal Sparse Representation Algorithms for Harmonic Retrieval
Brito, Alejandro E. (author) / Villalobos, Cristina (author) / Cabrera, Sergio D. (author)
Optimization and Engineering ; 5 ; 503-531
2004-12-01
29 pages
Article (Journal)
Electronic Resource
English
Interior-Point Methods in l1 Optimal Sparse Representation Algorithms for Harmonic Retrieval
| Online Contents | 2004
On sparse matrix orderings in interior point methods
| Online Contents | 2013
On sparse matrix orderings in interior point methods
| Springer Verlag | 2013
Interior point multigrid methods for topology optimization
| British Library Online Contents | 2000