Charles Dossal

Math. Program., March, 2024

2023

Convergence rates of the Heavy-Ball method under the Łojasiewicz property.

[BibT_eX]

[DOI]

Math. Program., March, 2023

2022

Convergence Rates of the Heavy Ball Method for Quasi-strongly Convex Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., September, 2022

2021

Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions.

[BibT_eX]

[DOI]

Math. Program., 2021

Overrelaxed Sinkhorn-Knopp Algorithm for Regularized Optimal Transport.

[BibT_eX]

[DOI]

Algorithms, 2021

2020

Convergence Rates of Damped Inertial Dynamics under Geometric Conditions and Perturbations.

[BibT_eX]

[DOI]

Othmane Sebbouh

SIAM J. Optim., 2020

Convergence rate of inertial Forward-Backward algorithm beyond Nesterov's rule.

[BibT_eX]

[DOI]

Vassilis Apidopoulos

Math. Program., 2020

2019

Optimal Convergence Rates for Nesterov Acceleration.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

2018

The Differential Inclusion Modeling FISTA Algorithm and Optimality of Convergence Rate in the Case b $\leq3$.

[BibT_eX]

[DOI]

Vassilis Apidopoulos

SIAM J. Optim., 2018

2017

Sampling the Fourier Transform Along Radial Lines.

[BibT_eX]

[DOI]

Vincent Duval

Clarice Poon

SIAM J. Numer. Anal., 2017

2016

Identifiability for Gauge Regularizations and Algorithms for Block-Sparse Synthesis in Compressive Sensing.

[BibT_eX]

[DOI]

Flavius Turcu

Marc Nicodeme

Proceedings of the 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2016

Sparse-Based Morphometry: Principle and Application to Alzheimer's Disease.

[BibT_eX]

[DOI]

Pierrick Coupé

Michèle Allard

Proceedings of the Patch-Based Techniques in Medical Imaging, 2016

2015

Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA.

[BibT_eX]

[DOI]

SIAM J. Optim., 2015

On the Convergence of the Iterates of the "Fast Iterative Shrinkage/Thresholding Algorithm".

[BibT_eX]

[DOI]

Antonin Chambolle

J. Optim. Theory Appl., 2015

Optimal Dual Certificates for Noise Robustness Bounds in Compressive Sensing.

[BibT_eX]

[DOI]

Marc Nicodeme

Flavius Turcu

J. Math. Imaging Vis., 2015

Identifiability and Noise Robustness for l1-Analysis Regularizations in Compressive Sensing.

[BibT_eX]

[DOI]

Marc Nicodeme

Flavius Turcu

Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2015

2014

An Evaluation of the Sparsity Degree for Sparse Recovery with Deterministic Measurement Matrices.

[BibT_eX]

[DOI]

J. Math. Imaging Vis., 2014

The Degrees of Freedom of Partly Smooth Regularizers.

[BibT_eX]

[DOI]

Samuel Vaiter

Gabriel Peyré

Jalal Fadili

CoRR, 2014

Lipschitz Bounds for Noise Robustness in Compressive Sensing: Two Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

2013

Robust Sparse Analysis Regularization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

2012

The degrees of freedom of the Group Lasso for a General Design

[BibT_eX]

[DOI]

Samuel Vaiter

Gabriel Peyré

Jalal Fadili

CoRR, 2012

Risk estimation for matrix recovery with spectral regularization

[BibT_eX]

[DOI]

CoRR, 2012

Unbiased risk estimation for sparse analysis regularization.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE International Conference on Image Processing, 2012

A greedy algorithm to extract sparsity degree for ℓ1/ℓ0-equivalence in a deterministic context.

[BibT_eX]

[DOI]

Proceedings of the 20th European Signal Processing Conference, 2012

2011

Bandlet image estimation with model selection.

[BibT_eX]

[DOI]