A survey on nonconvex regularization-based sparse and low-rank recovery in signal processing, statistics, and machine learning
In the past decade, sparse and low-rank recovery has drawn much attention in many areas
such as signal/image processing, statistics, bioinformatics, and machine learning. To …
such as signal/image processing, statistics, bioinformatics, and machine learning. To …
Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks
In this paper we consider nonconvex optimization and learning over a network of distributed
nodes. We develop a Proximal Primal-Dual Algorithm (Prox-PDA), which enables the …
nodes. We develop a Proximal Primal-Dual Algorithm (Prox-PDA), which enables the …
Non-intrusive energy disaggregation using non-negative matrix factorization with sum-to-k constraint
Energy disaggregation or non-intrusive load monitoring addresses the issue of extracting
device-level energy consumption information by monitoring the aggregated signal at one …
device-level energy consumption information by monitoring the aggregated signal at one …
ZONE: Zeroth-order nonconvex multiagent optimization over networks
In this paper, we consider distributed optimization problems over a multiagent network,
where each agent can only partially evaluate the objective function, and it is allowed to …
where each agent can only partially evaluate the objective function, and it is allowed to …
Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization
In this paper, we propose a perturbed proximal primal–dual algorithm (PProx-PDA) for an
important class of linearly constrained optimization problems, whose objective is the sum of …
important class of linearly constrained optimization problems, whose objective is the sum of …
Randomized robust subspace recovery and outlier detection for high dimensional data matrices
This paper explores and analyzes two randomized designs for robust principal component
analysis employing low-dimensional data sketching. In one design, a data sketch is …
analysis employing low-dimensional data sketching. In one design, a data sketch is …
Zeroth order nonconvex multi-agent optimization over networks
In this paper, we consider distributed optimization problems over a multi-agent network,
where each agent can only partially evaluate the objective function, and it is allowed to …
where each agent can only partially evaluate the objective function, and it is allowed to …
NESTT: A nonconvex primal-dual splitting method for distributed and stochastic optimization
We study a stochastic and distributed algorithm for nonconvex problems whose objective
consists a sum $ N $ nonconvex $ L_i/N $-smooth functions, plus a nonsmooth regularizer …
consists a sum $ N $ nonconvex $ L_i/N $-smooth functions, plus a nonsmooth regularizer …
Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
In this paper, we study a class of nonconvex nonsmooth optimization problems with bilinear
constraints, which have wide applications in machine learning and signal processing. We …
constraints, which have wide applications in machine learning and signal processing. We …
Toward model parallelism for deep neural network based on gradient-free ADMM framework
Alternating Direction Method of Multipliers (ADMM) has recently been proposed as a
potential alternative optimizer to the Stochastic Gradient Descent (SGD) for deep learning …
potential alternative optimizer to the Stochastic Gradient Descent (SGD) for deep learning …