A survey on nonconvex regularization-based sparse and low-rank recovery in signal processing, statistics, and machine learning

F Wen, L Chu, P Liu, RC Qiu - IEEE Access, 2018 - ieeexplore.ieee.org
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 …

Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks

M Hong, D Ha**ezhad… - … Conference on Machine …, 2017 - proceedings.mlr.press
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 …

Non-intrusive energy disaggregation using non-negative matrix factorization with sum-to-k constraint

A Rahimpour, H Qi, D Fugate… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Energy disaggregation or non-intrusive load monitoring addresses the issue of extracting
device-level energy consumption information by monitoring the aggregated signal at one …

ZONE: Zeroth-order nonconvex multiagent optimization over networks

D Ha**ezhad, M Hong, A Garcia - IEEE transactions on …, 2019 - ieeexplore.ieee.org
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 …

Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization

D Ha**ezhad, M Hong - Mathematical Programming, 2019 - Springer
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 …

Randomized robust subspace recovery and outlier detection for high dimensional data matrices

M Rahmani, GK Atia - IEEE Transactions on Signal Processing, 2016 - ieeexplore.ieee.org
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 …

Zeroth order nonconvex multi-agent optimization over networks

D Ha**ezhad, M Hong, A Garcia - arxiv preprint arxiv:1710.09997, 2017 - arxiv.org
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 …

NESTT: A nonconvex primal-dual splitting method for distributed and stochastic optimization

D Ha**ezhad, M Hong, T Zhao… - Advances in neural …, 2016 - proceedings.neurips.cc
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 …

Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications

D Ha**ezhad, Q Shi - Journal of Global Optimization, 2018 - Springer
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 …

Toward model parallelism for deep neural network based on gradient-free ADMM framework

J Wang, Z Chai, Y Cheng, L Zhao - 2020 IEEE International …, 2020 - ieeexplore.ieee.org
Alternating Direction Method of Multipliers (ADMM) has recently been proposed as a
potential alternative optimizer to the Stochastic Gradient Descent (SGD) for deep learning …