default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles Dossal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j18]Jean-François Aujol, Charles Dossal, Aude Rondepierre
:
FISTA is an automatic geometrically optimized algorithm for strongly convex functions. Math. Program. 204(1): 449-491 (2024)- [j17]Marc Dambrine, Charles Dossal, Bénédicte Puig, Aude Rondepierre:
Stochastic Differential Equations for Modeling First Order Optimization Methods. SIAM J. Optim. 34(2): 1402-1426 (2024) - [j16]Jean-François Aujol, Luca Calatroni, Charles Dossal, Hippolyte Labarrière, Aude Rondepierre:
Parameter-Free FISTA by Adaptive Restart and Backtracking. SIAM J. Optim. 34(4): 3259-3285 (2024) - 2023
- [j15]Jean-François Aujol, Charles Dossal, Aude Rondepierre:
Convergence rates of the Heavy-Ball method under the Łojasiewicz property. Math. Program. 198(1): 195-254 (2023) - 2022
- [j14]Jean-François Aujol, Charles Dossal, Aude Rondepierre:
Convergence Rates of the Heavy Ball Method for Quasi-strongly Convex Optimization. SIAM J. Optim. 32(3): 1817-1842 (2022) - 2021
- [j13]Alexis Thibault, Lénaïc Chizat, Charles Dossal, Nicolas Papadakis:
Overrelaxed Sinkhorn-Knopp Algorithm for Regularized Optimal Transport. Algorithms 14(5): 143 (2021) - [j12]Vassilis Apidopoulos, Jean-François Aujol, Charles Dossal, Aude Rondepierre:
Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions. Math. Program. 187(1): 151-193 (2021) - 2020
- [j11]Vassilis Apidopoulos, Jean-François Aujol, Charles Dossal:
Convergence rate of inertial Forward-Backward algorithm beyond Nesterov's rule. Math. Program. 180(1): 137-156 (2020) - [j10]Othmane Sebbouh, Charles Dossal, Aude Rondepierre:
Convergence Rates of Damped Inertial Dynamics under Geometric Conditions and Perturbations. SIAM J. Optim. 30(3): 1850-1877 (2020) - 2019
- [j9]Jean-François Aujol, Charles Dossal, Aude Rondepierre:
Optimal Convergence Rates for Nesterov Acceleration. SIAM J. Optim. 29(4): 3131-3153 (2019) - 2018
- [j8]Vassilis Apidopoulos, Jean-François Aujol, Charles Dossal:
The Differential Inclusion Modeling FISTA Algorithm and Optimality of Convergence Rate in the Case b $\leq3$. SIAM J. Optim. 28(1): 551-574 (2018) - 2017
- [j7]Charles Dossal, Vincent Duval, Clarice Poon:
Sampling the Fourier Transform Along Radial Lines. SIAM J. Numer. Anal. 55(6): 2540-2564 (2017) - 2015
- [j6]Marc Nicodeme, Flavius Turcu, Charles Dossal:
Optimal Dual Certificates for Noise Robustness Bounds in Compressive Sensing. J. Math. Imaging Vis. 53(3): 251-263 (2015) - [j5]Antonin Chambolle, Charles Dossal:
On the Convergence of the Iterates of the "Fast Iterative Shrinkage/Thresholding Algorithm". J. Optim. Theory Appl. 166(3): 968-982 (2015) - [j4]Jean-François Aujol, Charles Dossal:
Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA. SIAM J. Optim. 25(4): 2408-2433 (2015) - 2014
- [j3]Yannick Berthoumieu, Charles Dossal, Nelly Pustelnik, Philippe Ricoux, Flavius Turcu:
An Evaluation of the Sparsity Degree for Sparse Recovery with Deterministic Measurement Matrices. J. Math. Imaging Vis. 48(2): 266-278 (2014) - 2013
- [j2]Samuel Vaiter, Gabriel Peyré, Charles Dossal, Jalal Fadili:
Robust Sparse Analysis Regularization. IEEE Trans. Inf. Theory 59(4): 2001-2016 (2013) - 2011
- [j1]Charles Dossal, Erwan Le Pennec, Stéphane Mallat:
Bandlet image estimation with model selection. Signal Process. 91(12): 2743-2753 (2011)
Conference and Workshop Papers
- 2016
- [c6]Pierrick Coupé, Charles-Alban Deledalle, Charles Dossal, Michèle Allard:
Sparse-Based Morphometry: Principle and Application to Alzheimer's Disease. Patch-MI@MICCAI 2016: 43-50 - [c5]Flavius Turcu, Charles Dossal, Marc Nicodeme:
Identifiability for Gauge Regularizations and Algorithms for Block-Sparse Synthesis in Compressive Sensing. SYNASC 2016: 111-118 - 2015
- [c4]Marc Nicodeme, Flavius Turcu, Charles Dossal:
Identifiability and Noise Robustness for l1-Analysis Regularizations in Compressive Sensing. SYNASC 2015: 79-84 - 2014
- [c3]Marc Nicodeme, Charles Dossal, Flavius Turcu, Yannick Berthoumieu:
Lipschitz Bounds for Noise Robustness in Compressive Sensing: Two Algorithms. SYNASC 2014: 85-90 - 2012
- [c2]Nelly Pustelnik, Charles Dossal, Flavius Turcu, Yannick Berthoumieu, Philippe Ricoux:
A greedy algorithm to extract sparsity degree for ℓ1/ℓ0-equivalence in a deterministic context. EUSIPCO 2012: 859-863 - [c1]Charles-Alban Deledalle, Samuel Vaiter, Gabriel Peyré, Jalal Fadili, Charles Dossal:
Unbiased risk estimation for sparse analysis regularization. ICIP 2012: 3053-3056
Informal and Other Publications
- 2014
- [i6]Samuel Vaiter, Charles-Alban Deledalle, Gabriel Peyré, Jalal Fadili, Charles Dossal:
The Degrees of Freedom of Partly Smooth Regularizers. CoRR abs/1404.5557 (2014) - 2012
- [i5]Charles-Alban Deledalle, Samuel Vaiter, Gabriel Peyré, Jalal Fadili, Charles Dossal:
Risk estimation for matrix recovery with spectral regularization. CoRR abs/1205.1482 (2012) - [i4]Samuel Vaiter, Charles-Alban Deledalle, Gabriel Peyré, Jalal Fadili, Charles Dossal:
The degrees of freedom of the Group Lasso for a General Design. CoRR abs/1212.6478 (2012) - 2011
- [i3]Charles Dossal, Marie-Line Chabanol, Gabriel Peyré, Jalal Fadili:
Sharp Support Recovery from Noisy Random Measurements by L1 minimization. CoRR abs/1101.1577 (2011) - [i2]Samuel Vaiter, Gabriel Peyré, Charles Dossal, Jalal Fadili:
Robust Sparse Analysis Regularization. CoRR abs/1109.6222 (2011) - [i1]Charles Dossal, Maher Kachour, Jalal Fadili, Gabriel Peyré, Christophe Chesneau:
The degrees of freedom of penalized l1 minimization. CoRR abs/1111.1162 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
