Fetching the paper…
Reading the bibliography…
Error bound analysis, which estimates the distance of a point to the solution set of an optimization problem using the optimality residual, is a powerful tool for the analysis of first-order optimization algorithms.
On the convergence of the coordinate descent method for convex differentiable minimization
Zhi-Quan Luo and Paul Tseng · 1992
Earlier work this paper cites.
Error bounds and convergence analysis of feasible descent methods: a general approach
Zhi-Quan Luo and Paul Tseng · 1993
Earlier work this paper cites.
On the convergence rate of dual ascent methods for linearly constrained convex minimization
Zhi-Quan Luo and Paul Tseng · 1993
Earlier work this paper cites.
Error bounds in mathematical programming
Jong-Shi Pang · 1997
Earlier work this paper cites.
Nonlinear programming
Dimitri P Bertsekas · 1999
Earlier work this paper cites.
Convex analysis and optimization (conservative)
Dimitri Bertsekas and Angelia Nedic · 2003
Earlier work this paper cites.
Finite-dimensional variational inequalities and complementarity problems
Francisco Facchinei and Jong-Shi Pang · 2007
Earlier work this paper cites.
On the equivalence of nonnegative matrix factorization and k-means-spectral clustering
Chris Ding, Xiaofeng He, Horst D Simon, and Rong Jin · 2008
Earlier work this paper cites.
Optimal linear precoding strategies for wideband noncooperative systems based on game theory part i: Nash equilibria
Gesualdo Scutari, Daniel P Palomar, and Sergio Barbarossa · 2008
Cited alongside, same era.
K-means clustering is matrix factorization
Christian Bauckhage · 2015
Cited alongside, same era.
Nonnegative matrix factorization using admm: Algorithm and convergence analysis
Davood Hajinezhad, Tsung-Hui Chang, Xiangfeng Wang, Qingjiang Shi, and Mingyi Hong · 2016
Cited alongside, same era.
Prox-pda: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks
Mingyi Hong, Davood Hajinezhad, and Ming-Min Zhao · 2017
Cited alongside, same era.
On the linear convergence of the alternating direction method of multipliers
Mingyi Hong and Zhi-Quan Luo · 2017
Cited alongside, same era.
Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization
Davood Hajinezhad and Mingyi Hong · 2019
Later among the works it cites.
Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
Weiwei Kong, Jefferson G Melo, and Renato DC Monteiro · 2019
Later among the works it cites.
Inexact proximal-point penalty methods for non-convex optimization with non-convex constraints
Qihang Lin, Runchao Ma, and Yangyang Xu · 2019
Later among the works it cites.
Global convergence of admm in nonconvex nonsmooth optimization
Yu Wang, Wotao Yin, and Jinshan Zeng · 2019
Later among the works it cites.
A family of inexact sqa methods for non-smooth convex minimization with provable convergence guarantees based on the luo–tseng error bound property
Man-Chung Yue, Zirui Zhou, and Anthony Man-Cho So · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Nonconvex lagrangian-based optimization: monitoring schemes and global convergence
Jérôme Bolte, Shoham Sabach, and Marc Teboulle · 2018
Cited alongside, same era.
On nonconvex decentralized gradient descent
Jinshan Zeng and Wotao Yin · 2018
Cited alongside, same era.
Later among the works it cites.
Collaborative detection and power allocation framework for target tracking in multiple radar system
Junkun Yan, Wenqiang Pu, Shenghua Zhou, Hongwei Liu, and Zheng Bao · 2020
Closest in time.
Jiawei Zhang and Zhi-Quan Luo · 2020
Closest in time.