| Publication | Date of Publication | Type |
|---|
A complexity analysis framework for active manifold identification with applications to \(L_0\) and \(L_p\) regularization models (edit)
Applied Mathematics and Optimization | 2026-03-23 | Paper |
Full splitting algorithms for fractional programs with structured numerators and denominators
SIAM Journal on Optimization | 2026-01-08 | Paper |
A single-loop proximal subgradient algorithm for A class structured fractional programs
Journal of Scientific Computing | 2025-08-12 | Paper |
On partial smoothness, activity identification and faster algorithms of \(L_1\) over \(L_2\) minimization
IEEE Transactions on Signal Processing | 2024-09-16 | Paper |
| A full splitting algorithm for fractional programs with structured numerators and denominators | 2023-12-21 | Paper |
Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery
Journal of Scientific Computing | 2023-06-20 | Paper |
Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity
Journal of Optimization Theory and Applications | 2023-04-17 | Paper |
Minimizing \(L_1\) over \(L_2\) norms on the gradient
Inverse Problems | 2022-05-12 | Paper |
Minimization of \(L_1\) over \(L_2\) for sparse signal recovery with convergence guarantee
SIAM Journal on Scientific Computing | 2022-04-21 | Paper |
Limited-angle CT reconstruction via the \(L_1/L_2\) minimization
SIAM Journal on Imaging Sciences | 2021-11-19 | Paper |
Convergence study of indefinite proximal ADMM with a relaxation factor
Computational Optimization and Applications | 2020-07-29 | Paper |
On Glowinski's open question on the alternating direction method of multipliers
Journal of Optimization Theory and Applications | 2019-03-06 | Paper |
Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization
Advances in Computational Mathematics | 2018-07-24 | Paper |
The generalized proximal point algorithm with step size 2 is not necessarily convergent
Computational Optimization and Applications | 2018-07-20 | Paper |
Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems
SIAM Journal on Optimization | 2018-05-18 | Paper |
On the optimal linear convergence rate of a generalized proximal point algorithm
Journal of Scientific Computing | 2018-04-12 | Paper |
Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
Mathematics of Operations Research | 2017-09-22 | Paper |
Accelerated Uzawa methods for convex optimization
Mathematics of Computation | 2017-03-27 | Paper |
On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints
Linear Algebra and its Applications | 2016-12-28 | Paper |
Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints
BIT | 2016-06-10 | Paper |
On the Optimal Linear Convergence Rate of a Generalized Proximal Point Algorithm
(available as arXiv preprint) | 2016-05-18 | Paper |
A splitting method for separable convex programming
IMA Journal of Numerical Analysis | 2015-02-17 | Paper |
| Some parallel splitting methods for separable convex programming with the \(O(\frac{1}{t})\) convergence rate | 2014-06-23 | Paper |
Linearized alternating direction method for constrained linear least-squares problem.
East Asian Journal on Applied Mathematics | 2014-04-04 | Paper |
Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers
SIAM Journal on Imaging Sciences | 2014-01-23 | Paper |
An alternating direction-based contraction method for linearly constrained separable convex programming problems
Optimization | 2013-07-24 | Paper |
On the \(O(1/t)\) convergence rate of alternating direction method with logarithmic-quadratic proximal regularization
SIAM Journal on Optimization | 2013-04-09 | Paper |
An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures
Computational Optimization and Applications | 2012-09-27 | Paper |
Alternating direction method with Gaussian back substitution for separable convex programming
SIAM Journal on Optimization | 2012-09-12 | Paper |
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
SIAM Journal on Optimization | 2011-06-06 | Paper |
Solving a class of matrix minimization problems by linear variational inequality approaches
Linear Algebra and its Applications | 2011-04-11 | Paper |
| A modified proximal-based decomposition method for variational inequalities | 2010-07-08 | Paper |
| Comparison of two kinds of approximate proximal point algorithms for monotone variational inequalities | 2009-11-11 | Paper |
| Mathematical modeling and optimization design of the convex shape bionic bulldozing plate surface | 2007-11-08 | Paper |
Comparison of two approximal proximal point algorithms for monotone variational inequalities
Journal of Zhejiang University. Science A | 2007-09-03 | Paper |
Critical role of domain switching on the fracture toughness of poled ferroelectrics
International Journal of Solids and Structures | 2001-05-17 | Paper |
On Partly Smoothness, Activity Identification and Faster Algorithms of $L_1$ over $L_2$ Minimization
(available as arXiv preprint) | N/A | Paper |
