A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- 1 January 2013
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 23 (2), 1126-1153
- https://doi.org/10.1137/120891009
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Maximum Block Improvement and Polynomial OptimizationSIAM Journal on Optimization, 2012
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- Inexact block coordinate descent methods with application to non-negative matrix factorizationIMA Journal of Numerical Analysis, 2011
- Power Control By Geometric ProgrammingIEEE Transactions on Wireless Communications, 2007
- Signal Recovery by Proximal Forward-Backward SplittingMultiscale Modeling & Simulation, 2005
- Recent developments in CANDECOMP/PARAFAC algorithms: a critical reviewChemometrics and Intelligent Laboratory Systems, 2003
- On the convergence of the block nonlinear Gauss–Seidel method under convex constraintsOperations Research Letters, 2000
- Globally convergent block-coordinate techniques for unconstrained optimizationOptimization Methods and Software, 1999
- Asymptotic properties of the fenchel dual functional and applications to decomposition problemsJournal of Optimization Theory and Applications, 1992
- Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decompositionPsychometrika, 1970