Block-Coordinate Gradient Descent Method for Linearly Constrained Nonsmooth Separable Optimization

This publication has 31 references indexed in Scilit:

• The Group Lasso for Logistic Regression
  Journal of the Royal Statistical Society Series B: Statistical Methodology, 2008
• General Polynomial Time Decomposition Algorithms
  Lecture Notes in Computer Science, 2005
• Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization
  Journal of Optimization Theory and Applications, 2001
• Iterative Solution of Nonlinear Equations in Several Variables
  2000
• Variational Analysis
  1998
• Algorithms for the Least Distance Problem
  1993
• A successive quadratic programming method for a class of constrained nonsmooth optimization problems
  Mathematical Programming, 1990
• A method for minimizing the sum of a convex function and a continuously differentiable function
  Journal of Optimization Theory and Applications, 1986
• A generalized proximal point algorithm for certain non-convex minimization problems
  International Journal of Systems Science, 1981
• Convex Analysis
  1970