activity
20162026
most citedMinimizing L1 over L2 norms on the gradient

25 citations · 34 across the 8 of their papers we have counts for

collaborators
Showing math.OCShow all

6 papers · 1 filter

math.OC2026

Whole-Sequence Convergence of Variable-Smoothing Full-Splitting Methods via a Lifted Kurdyka-Łojasiewicz Framework

Min Tao

We establish whole-sequence convergence of the primal iterates of the smoothing-based full-splitting proximal subgradient method (S-FSPS) of Boţ, Li, and Tao (SIAM J. Optim., 35 (2…

math.OC2026

Counterexamples to Whole-Sequence Convergence of Variable-Smoothing Full-Splitting Methods

Min Tao

We study whole-sequence convergence of the smoothing-based full-splitting proximal subgradient method (S-FSPS) for structured nonconvex and nonsmooth fractional programs, introduce…

math.OC2021

Unified Analysis on L1 over L2 Minimization for signal recovery

Min Tao, Xiao-Ping Zhang

In this paper, we carry out a unified study for over sparsity promoting models, which are widely used in the regime of coherent dictionaries for recovering sparse nonne…

math.OC2020★ 6 cited

Limited-angle CT reconstruction via the L1/L2 minimization

Chao Wang, Min Tao, James Nagy +1

In this paper, we consider minimizing the L1/L2 term on the gradient for a limited-angle scanning problem in computed tomography (CT) reconstruction. We design a specific splitting…

math.OC2016

Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization

Min Tao, Xiaoming Yuan

Recently, the alternating direction method of multipliers (ADMM) has found many efficient applications in various areas; and it has been shown that the convergence is not guarantee…

math.OC2016★ 3 cited

On the Optimal Linear Convergence Rate of a Generalized Proximal Point Algorithm

Min Tao, Xiaoming Yuan

The proximal point algorithm (PPA) has been well studied in the literature. In particular, its linear convergence rate has been studied by Rockafellar in 1976 under certain conditi…