| Publication | Date of Publication | Type |
|---|
| Sparse sampling Kaczmarz–Motzkin method with linear convergence | 2023-12-19 | Paper |
| A Weighted Randomized Sparse Kaczmarz Method for Solving Linear Systems | 2023-06-11 | Paper |
| Revisiting linearized Bregman iterations under Lipschitz-like convexity condition | 2022-12-21 | Paper |
| A weighted randomized sparse Kaczmarz method for solving linear systems | 2022-11-24 | Paper |
| Inertial proximal incremental aggregated gradient method with linear convergence guarantees | 2022-10-18 | Paper |
| Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems | 2022-07-22 | Paper |
| Adaptively sketched Bregman projection methods for linear systems | 2022-05-12 | Paper |
| Revisiting Linearized Bregman Iterations under Lipschitz-like Convexity Condition | 2022-03-03 | Paper |
| Adaptively Sketched Bregman Projection Methods for Linear Systems | 2021-12-29 | Paper |
| Mirror frameworks for relatively Lipschitz and monotone-like variational inequalities | 2021-08-26 | Paper |
| New regularization method and iteratively reweighted algorithm for sparse vector recovery | 2021-06-17 | Paper |
| Training GANs with centripetal acceleration | 2021-04-15 | Paper |
| Extragradient and Extrapolation Methods with Generalized Bregman Distances for Saddle Point Problems | 2021-01-25 | Paper |
| Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions | 2020-09-15 | Paper |
| Linear convergence of random dual coordinate incremental aggregated gradient methods | 2020-08-29 | Paper |
| New analysis of linear convergence of gradient-type methods via unifying error bound conditions | 2020-02-20 | Paper |
| Nonconvex proximal incremental aggregated gradient method with linear convergence | 2019-10-02 | Paper |
| Inertial Bregman Proximal Gradient Algorithm For Nonconvex Problem with Smooth Adaptable Property | 2019-04-08 | Paper |
| A New Exact Worst-Case Linear Convergence Rate of the Proximal Gradient Method | 2019-02-25 | Paper |
| On robust width property for Lasso and Dantzig selector | 2018-04-06 | Paper |
| Inertial Proximal Incremental Aggregated Gradient Method | 2017-12-04 | Paper |
| Robust analysis ℓ1-recovery from Gaussian measurements and total variation minimization | 2017-11-24 | Paper |
| Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization | 2017-06-29 | Paper |
| The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth | 2017-04-20 | Paper |
| One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations | 2016-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3451275 | 2015-11-13 | Paper |
| On uniqueness guarantees of solution in convex regularized linear inverse problems | 2015-09-28 | Paper |
| Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization | 2015-07-22 | Paper |
| Necessary and sufficient conditions of solution uniqueness in 1-norm minimization | 2015-03-11 | Paper |
| Projective splitting methods for sums of maximal monotone operators with applications | 2015-02-25 | Paper |
| A dual algorithm for a class of augmented convex signal recovery models | 2015-02-25 | Paper |
| Variants of alternating minimization method with sublinear rates of convergence for convex optimization | 2014-11-26 | Paper |
| Online manifold regularization by dual ascending procedure | 2014-11-24 | Paper |
| New bounds for circulant Johnson-Lindenstrauss embeddings | 2014-11-18 | Paper |
| Reweighted minimization model for MR image reconstruction with split Bregman method | 2013-08-20 | Paper |
| A fast fixed point algorithm for total variation deblurring and segmentation | 2013-01-22 | Paper |
| Strongly convex programming for exact matrix completion and robust principal component analysis | 2012-07-12 | Paper |
| A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm | 2011-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3071307 | 2011-02-05 | Paper |
| Nuclear norm regularization with a low-rank constraint for matrix completion | 2010-12-14 | Paper |
| Projected Landweber iteration for matrix completion | 2010-10-11 | Paper |
| A cut-and-project perspective for linearized Bregman iterations | N/A | Paper |
