IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v54y2013i2p399-416.html
   My bibliography  Save this article

An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography

Author

Listed:
  • Ignace Loris
  • Caroline Verhoeven

Abstract

We propose an iterative algorithm for the minimization of a ℓ 1 -norm penalized least squares functional, under additional linear constraints. The algorithm is fully explicit: it uses only matrix multiplications with the three matrices present in the problem (in the linear constraint, in the data misfit part and in the penalty term of the functional). None of the three matrices must be invertible. Convergence is proven in a finite-dimensional setting. We apply the algorithm to a synthetic problem in magneto-encephalography where it is used for the reconstruction of divergence-free current densities subject to a sparsity promoting penalty on the wavelet coefficients of the current densities. We discuss the effects of imposing zero divergence and of imposing joint sparsity (of the vector components of the current density) on the current density reconstruction. Copyright Springer Science+Business Media, LLC 2013

Suggested Citation

  • Ignace Loris & Caroline Verhoeven, 2013. "An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography," Computational Optimization and Applications, Springer, vol. 54(2), pages 399-416, March.
  • Handle: RePEc:spr:coopap:v:54:y:2013:i:2:p:399-416
    DOI: 10.1007/s10589-012-9482-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-012-9482-y
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10589-012-9482-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Giannone, Domenico & De Mol, Christine & Daubechies, Ingrid & Brodie, Joshua, 2007. "Sparse and Stable Markowitz Portfolios," CEPR Discussion Papers 6474, C.E.P.R. Discussion Papers.
    2. Patrick L. Combettes & Jean-Christophe Pesquet, 2011. "Proximal Splitting Methods in Signal Processing," Springer Optimization and Its Applications, in: Heinz H. Bauschke & Regina S. Burachik & Patrick L. Combettes & Veit Elser & D. Russell Luke & Henry (ed.), Fixed-Point Algorithms for Inverse Problems in Science and Engineering, chapter 0, pages 185-212, Springer.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gianbiagio Curato & Jim Gatheral & Fabrizio Lillo, 2014. "Optimal execution with nonlinear transient market impact," Papers 1412.4839, arXiv.org.
    2. Giovanni Bonaccolto & Massimiliano Caporin & Sandra Paterlini, 2018. "Asset allocation strategies based on penalized quantile regression," Computational Management Science, Springer, vol. 15(1), pages 1-32, January.
    3. Guillaume Sagnol & Edouard Pauwels, 2019. "An unexpected connection between Bayes A-optimal designs and the group lasso," Statistical Papers, Springer, vol. 60(2), pages 565-584, April.
    4. Ernest K. Ryu & Yanli Liu & Wotao Yin, 2019. "Douglas–Rachford splitting and ADMM for pathological convex optimization," Computational Optimization and Applications, Springer, vol. 74(3), pages 747-778, December.
    5. Fan, Jianqing & Liao, Yuan & Shi, Xiaofeng, 2015. "Risks of large portfolios," Journal of Econometrics, Elsevier, vol. 186(2), pages 367-387.
    6. Junhong Lin & Lorenzo Rosasco & Silvia Villa & Ding-Xuan Zhou, 2018. "Modified Fejér sequences and applications," Computational Optimization and Applications, Springer, vol. 71(1), pages 95-113, September.
    7. A. Belloni & D. Chen & V. Chernozhukov & C. Hansen, 2012. "Sparse Models and Methods for Optimal Instruments With an Application to Eminent Domain," Econometrica, Econometric Society, vol. 80(6), pages 2369-2429, November.
    8. Silvia Bonettini & Peter Ochs & Marco Prato & Simone Rebegoldi, 2023. "An abstract convergence framework with application to inertial inexact forward–backward methods," Computational Optimization and Applications, Springer, vol. 84(2), pages 319-362, March.
    9. Puya Latafat & Panagiotis Patrinos, 2017. "Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operators," Computational Optimization and Applications, Springer, vol. 68(1), pages 57-93, September.
    10. Sedi Bartz & Rubén Campoy & Hung M. Phan, 2022. "An Adaptive Alternating Direction Method of Multipliers," Journal of Optimization Theory and Applications, Springer, vol. 195(3), pages 1019-1055, December.
    11. Maillet, Bertrand & Tokpavi, Sessi & Vaucher, Benoit, 2015. "Global minimum variance portfolio optimisation under some model risk: A robust regression-based approach," European Journal of Operational Research, Elsevier, vol. 244(1), pages 289-299.
    12. Yu-Min Yen, 2010. "A Note on Sparse Minimum Variance Portfolios and Coordinate-Wise Descent Algorithms," Papers 1005.5082, arXiv.org, revised Sep 2013.
    13. Hautsch, Nikolaus & Voigt, Stefan, 2019. "Large-scale portfolio allocation under transaction costs and model uncertainty," Journal of Econometrics, Elsevier, vol. 212(1), pages 221-240.
    14. Hedy Attouch & Alexandre Cabot & Zaki Chbani & Hassan Riahi, 2018. "Inertial Forward–Backward Algorithms with Perturbations: Application to Tikhonov Regularization," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 1-36, October.
    15. Conflitti, Cristina & De Mol, Christine & Giannone, Domenico, 2015. "Optimal combination of survey forecasts," International Journal of Forecasting, Elsevier, vol. 31(4), pages 1096-1103.
    16. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," LIDAM Discussion Papers CORE 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. Suthep Suantai & Kunrada Kankam & Prasit Cholamjiak, 2020. "A Novel Forward-Backward Algorithm for Solving Convex Minimization Problem in Hilbert Spaces," Mathematics, MDPI, vol. 8(1), pages 1-13, January.
    18. Wang, Yugang & Huang, Ting-Zhu & Zhao, Xi-Le & Deng, Liang-Jian & Ji, Teng-Yu, 2020. "A convex single image dehazing model via sparse dark channel prior," Applied Mathematics and Computation, Elsevier, vol. 375(C).
    19. Serge Darolles & Christian Gouriéroux & Emmanuelle Jay, 2012. "Robust Portfolio Allocation with Systematic Risk Contribution Restrictions," Working Papers 2012-35, Center for Research in Economics and Statistics.
    20. Yu Zheng & Timothy M. Hospedales & Yongxin Yang, 2018. "Diversity and Sparsity: A New Perspective on Index Tracking," Papers 1809.01989, arXiv.org, revised Feb 2020.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:54:y:2013:i:2:p:399-416. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.