| Publication | Date of Publication | Type |
|---|
On degenerate preconditioned proximal point methods under restricted monotonicity
Journal of Optimization Theory and Applications | 2026-01-29 | Paper |
Sparse sampling Kaczmarz–Motzkin method with linear convergence
Mathematical Methods in the Applied Sciences | 2023-12-19 | Paper |
A Weighted Randomized Sparse Kaczmarz Method for Solving Linear Systems
(available as arXiv preprint) | 2023-06-11 | Paper |
Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
Mathematics of Computation | 2022-12-21 | Paper |
A weighted randomized sparse Kaczmarz method for solving linear systems
Computational and Applied Mathematics | 2022-11-24 | Paper |
Inertial proximal incremental aggregated gradient method with linear convergence guarantees
Mathematical Methods of Operations Research | 2022-10-18 | Paper |
Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems
Operations Research Letters | 2022-07-22 | Paper |
Adaptively sketched Bregman projection methods for linear systems
Inverse Problems | 2022-05-12 | Paper |
Revisiting Linearized Bregman Iterations under Lipschitz-like Convexity Condition
(available as arXiv preprint) | 2022-03-03 | Paper |
Adaptively Sketched Bregman Projection Methods for Linear Systems
(available as arXiv preprint) | 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
AMM. Applied Mathematics and Mechanics. (English Edition) | 2021-06-17 | Paper |
Training GANs with centripetal acceleration
Optimization Methods & Software | 2021-04-15 | Paper |
Extragradient and Extrapolation Methods with Generalized Bregman Distances for Saddle Point Problems
(available as arXiv preprint) | 2021-01-25 | Paper |
Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions
Journal of Global Optimization | 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
Mathematical Programming. Series A. Series B | 2020-02-20 | Paper |
Nonconvex proximal incremental aggregated gradient method with linear convergence
Journal of Optimization Theory and Applications | 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
Communications in Mathematical Sciences | 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
European Journal of Applied Mathematics | 2017-11-24 | Paper |
Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization
Optimization Letters | 2017-06-29 | Paper |
The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth
Optimization Letters | 2017-04-20 | Paper |
One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
Advances in Computational Mathematics | 2016-12-15 | Paper |
| Precondition techniques for accelerated linearized Bregman algorithms | 2015-11-13 | Paper |
On uniqueness guarantees of solution in convex regularized linear inverse problems
Linear Algebra and its Applications | 2015-09-28 | Paper |
Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization
Optimization Letters | 2015-07-22 | Paper |
Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
Journal of Optimization Theory and Applications | 2015-03-11 | Paper |
Projective splitting methods for sums of maximal monotone operators with applications
Journal of Mathematical Analysis and Applications | 2015-02-25 | Paper |
A dual algorithm for a class of augmented convex signal recovery models
Communications in Mathematical Sciences | 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
Mathematical Problems in Engineering | 2014-11-24 | Paper |
New bounds for circulant Johnson-Lindenstrauss embeddings
Communications in Mathematical Sciences | 2014-11-18 | Paper |
Reweighted minimization model for MR image reconstruction with split Bregman method
Science China Information Sciences | 2013-08-20 | Paper |
A fast fixed point algorithm for total variation deblurring and segmentation
Journal of Mathematical Imaging and Vision | 2013-01-22 | Paper |
Strongly convex programming for exact matrix completion and robust principal component analysis
Inverse Problems and Imaging | 2012-07-12 | Paper |
A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm
Applied and Computational Harmonic Analysis | 2011-11-02 | Paper |
| \(A^-\)-linearized Bregman iteration algorithm | 2011-02-05 | Paper |
Nuclear norm regularization with a low-rank constraint for matrix completion
Inverse Problems | 2010-12-14 | Paper |
Projected Landweber iteration for matrix completion
Journal of Computational and Applied Mathematics | 2010-10-11 | Paper |
A cut-and-project perspective for linearized Bregman iterations
(available as arXiv preprint) | N/A | Paper |
