activity
20152021
most citedA Unified Successive Pseudo-Convex Approximation Framework

93 citations · 244 across the 8 of their papers we have counts for

collaborators

10 papers

eess.SP2021★ 7 cited

Extended Successive Convex Approximation for Phase Retrieval with Dictionary Learning

Tianyi Liu, Andreas M. Tillmann, Yang Yang +2

Phase retrieval aims at reconstructing unknown signals from magnitude measurements of linear mixtures. In this paper, we consider the phase retrieval with dictionary learning probl…

math.OC2020

Convergence analysis of a relaxed inertial alternating minimization algorithm with applications

Yang Yang, Yuchao Tang, Jigen Peng

The alternating direction method of multipliers (ADMM) is a popular method for solving convex separable minimization problems with linear equality constraints. The generalization o…

math.OC2020

An inertial alternating direction method of multipliers for solving a two-block separable convex minimization problem

Yang Yang, Yuchao Tang

The alternating direction method of multipliers (ADMM) is a widely used method for solving many convex minimization models arising in signal and image processing. In this paper, we…

math.FA2019

Convergence analysis of an inexact inertial Krasnoselskii-Mann algorithm with applications

Fuying Cui, Yang Yang, Yuchao Tang +1

The classical Krasnoselskii-Mann iteration is broadly used for approximating fixed points of nonexpansive operators. To accelerate the convergence of the Krasnoselskii-Mann iterati…

math.OC2019★ 86 cited

Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization

Yang Yang, Marius Pesavento, Zhi-Quan Luo +1

In this paper, we propose an inexact block coordinate descent algorithm for large-scale nonsmooth nonconvex optimization problems. At each iteration, a particular block variable is…

math.OC2019★ 22 cited

An inertial three-operator splitting algorithm with applications to image inpainting

Fuying Cui, Yuchao Tang, Yang Yang

The three-operators splitting algorithm is a popular operator splitting method for finding the zeros of the sum of three maximally monotone operators, with one of which is cocoerci…

cs.LG2018★ 36 cited

Successive Convex Approximation Algorithms for Sparse Signal Estimation with Nonconvex Regularizations

Yang Yang, Marius Pesavento, Symeon Chatzinotas +1

In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is nonconvex and…

cs.DC2017

A Parallel Best-Response Algorithm with Exact Line Search for Nonconvex Sparsity-Regularized Rank Minimization

Yang Yang, Marius Pesavento

In this paper, we propose a convergent parallel best-response algorithm with the exact line search for the nondifferentiable nonconvex sparsity-regularized rank minimization proble…

cs.IT2016

Multidimensional Sparse Recovery for MIMO Channel Parameter Estimation

Christian Steffens, Yang Yang, Marius Pesavento

Multipath propagation is a common phenomenon in wireless communication. Knowledge of propagation path parameters such as complex channel gain, propagation delay or angle-of-arrival…

math.OC2015★ 93 cited

A Unified Successive Pseudo-Convex Approximation Framework

Yang Yang, Marius Pesavento

In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems.…