Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Ramzi Ben Mhenni"'
Publikováno v:
Optimization Methods and Software
Optimization Methods and Software, Taylor & Francis, In press, ⟨10.1080/10556788.2021.1977809⟩
ICCOPT, International Conference on Continuous Optimization
ICCOPT, International Conference on Continuous Optimization, 2019, Berlin, Germany
Optimization Methods and Software, Taylor & Francis, In press, ⟨10.1080/10556788.2021.1977809⟩
ICCOPT, International Conference on Continuous Optimization
ICCOPT, International Conference on Continuous Optimization, 2019, Berlin, Germany
International audience; Finding solutions to least-squares problems with low cardinality has found many applications, including portfolio optimization, subset selection in statistics, and inverse problems in signal processing. Although most works con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96bcc42fb1e09963d2adbb11510e5491
https://hal-ensta-bretagne.archives-ouvertes.fr/hal-03419540
https://hal-ensta-bretagne.archives-ouvertes.fr/hal-03419540
Publikováno v:
ICASSP
ICASSP 2020, IEEE International Conference on Acoustics, Speech and Signal Processing
ICASSP 2020, IEEE International Conference on Acoustics, Speech and Signal Processing, May 2020, Barcelona, Spain. pp.ISBN: 978-1-5090-6632-2, ⟨10.1109/ICASSP40776.2020.9053870⟩
ICASSP 2020, IEEE International Conference on Acoustics, Speech and Signal Processing
ICASSP 2020, IEEE International Conference on Acoustics, Speech and Signal Processing, May 2020, Barcelona, Spain. pp.ISBN: 978-1-5090-6632-2, ⟨10.1109/ICASSP40776.2020.9053870⟩
International audience; We propose a global optimization approach to solve ℓ 0 -norm penalized least-squares problems, using a dedicated branch-and-bound methodology. A specific tree search strategy is built, with branching rules inspired from gree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f19c843e21b4817242bd7112dbc08506
https://doi.org/10.1109/icassp40776.2020.9053870
https://doi.org/10.1109/icassp40776.2020.9053870
Publikováno v:
ICASSP
ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), May 2020, Barcelona, Spain. pp.5390-5394, ⟨10.1109/ICASSP40776.2020.9054670⟩
ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), May 2020, Barcelona, Spain. pp.5390-5394, ⟨10.1109/ICASSP40776.2020.9054670⟩
International audience; We propose a new greedy sparse approximation algorithm, called SLS for Single L1 Selection, that addresses a least squares optimization problem under a cardinality constraint. The specificity and increased efficiency of SLS or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c95d1c3501c3155fb218af0c42c357f
https://doi.org/10.1109/icassp40776.2020.9054670
https://doi.org/10.1109/icassp40776.2020.9054670
Publikováno v:
IEEE Whispers (2018) : 9th Workshop on Hyperspectral Image and Signal Processing
IEEE Whispers (2018) : 9th Workshop on Hyperspectral Image and Signal Processing, Sep 2018, Amsterdam, Netherlands
WHISPERS
IEEE Whispers (2018) : 9th Workshop on Hyperspectral Image and Signal Processing, Sep 2018, Amsterdam, Netherlands
WHISPERS
International audience; This paper addresses the linear spectral unmixing problem, by incorporating different constraints that may be of interest in order to cope with spectral variability: sparsity (few nonzero abundances), group exclusivity (at mos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::770acd3da610751cfedef1eaf1f39f0a
https://hal.archives-ouvertes.fr/hal-02051443/file/BenMhenni_WHISPERS18.pdf
https://hal.archives-ouvertes.fr/hal-02051443/file/BenMhenni_WHISPERS18.pdf