Min Tao

From MaRDI portal
Person:291884

Available identifiers

zbMath Open tao.minMaRDI QIDQ291884

List of research outcomes





PublicationDate of PublicationType
On partial smoothness, activity identification and faster algorithms of \(L_1\) over \(L_2\) minimization2024-09-16Paper
A full splitting algorithm for fractional programs with structured numerators and denominators2023-12-21Paper
Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery2023-06-20Paper
Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity2023-04-17Paper
Minimizing L 1 over L 2 norms on the gradient2022-05-12Paper
Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee2022-04-21Paper
Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization2021-11-19Paper
Convergence study of indefinite proximal ADMM with a relaxation factor2020-07-29Paper
On Glowinski's open question on the alternating direction method of multipliers2019-03-06Paper
Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization2018-07-24Paper
The generalized proximal point algorithm with step size 2 is not necessarily convergent2018-07-20Paper
Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems2018-05-18Paper
On the optimal linear convergence rate of a generalized proximal point algorithm2018-04-12Paper
Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming2017-09-22Paper
Accelerated Uzawa methods for convex optimization2017-03-27Paper
On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints2016-12-28Paper
Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints2016-06-10Paper
On the Optimal Linear Convergence Rate of a Generalized Proximal Point Algorithm2016-05-18Paper
A splitting method for separable convex programming2015-02-17Paper
Some parallel splitting methods for separable convex programming with the \(O(\frac{1}{t})\) convergence rate2014-06-23Paper
Linearized alternating direction method for constrained linear least-squares problem.2014-04-04Paper
Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers2014-01-23Paper
An alternating direction-based contraction method for linearly constrained separable convex programming problems2013-07-24Paper
On the \(O(1/t)\) convergence rate of alternating direction method with logarithmic-quadratic proximal regularization2013-04-09Paper
An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures2012-09-27Paper
Alternating direction method with Gaussian back substitution for separable convex programming2012-09-12Paper
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations2011-06-06Paper
Solving a class of matrix minimization problems by linear variational inequality approaches2011-04-11Paper
A modified proximal-based decomposition method for variational inequalities2010-07-08Paper
Comparison of two kinds of approximate proximal point algorithms for monotone variational inequalities2009-11-11Paper
Mathematical modeling and optimization design of the convex shape bionic bulldozing plate surface2007-11-08Paper
Comparison of two approximal proximal point algorithms for monotone variational inequalities2007-09-03Paper
Critical role of domain switching on the fracture toughness of poled ferroelectrics2001-05-17Paper
On Partly Smoothness, Activity Identification and Faster Algorithms of $L_1$ over $L_2$ MinimizationN/APaper

Research outcomes over time

This page was built for person: Min Tao