Some Notes on Alternating Optimization

By James C. Bezdek, Richard J. Hathaway. Advances in Soft Computing, 2002

368 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Reinforcement Learning with Parameterized Actions (2015, background): “However, it has the potential to bypass nearby local optima (Bezdek and Hathaway 2002).”
Multiview Spectral Embedding (2010, methodology): “In this paper, we derive an iterative algorithm by using the alternating optimization [14] to obtain a local optimal solution.”
An Improved Multi-task Learning Approach with Applications in Medical Diagnosis (2008, methodology): “We use the results developed in the mathematical programming field [13,14] to obtain a global convergence analysis which requires that both subproblems, (5) and (6), have an unique optimal solution.”
Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation (2010, methodology): “The simplified update step is obtained by applying a single iteration of alternated-optimization [17], [39], given by (8) The above process is known to ultimately converge to the optimum,4 and when truncated, supplies an approximation which still reduces the penalty term.”