Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
type: Item
instance of: scholarly article
title: Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
zbMATH Open document ID: 1190.90279
published in: Journal of Optimization Theory and Applications
publication date: 2009-05-05T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5550745
zbMATH Keywords: support vector machines
zbMATH Keywords: bilevel optimization
zbMATH Keywords: \(\ell_{1}\)-regularization
zbMATH Keywords: global convergence
zbMATH Keywords: linear convergence rate
zbMATH Keywords: complexity bound
author: Paul Tseng
author: Sangwoon Yun
describes a project that uses: SVMlight
describes a project that uses: PDCO
MaRDI profile type: Publication
OpenAlex ID: W2072265605
cites work: Convex Analysis
cites work: A successive quadratic programming method for a class of constrained nonsmooth optimization problems
cites work: A generalized proximal point algorithm for certain non-convex minimization problems
cites work: A method for minimizing the sum of a convex function and a continuously differentiable function
cites work: A minimization method for the sum of a convex function and a continuously differentiable function
cites work: A coordinate gradient descent method for nonsmooth separable minimization
cites work: Q3730336
cites work: Q3151174
cites work: Q4226179
cites work: Numerical Optimization
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Atomic decomposition by basis pursuit
cites work: Ideal spatial adaptation by wavelet shrinkage
cites work: Exact Regularization of Convex Programs
cites work: Pathwise coordinate optimization
cites work: Q4864293
cites work: Convergence of a block coordinate descent method for nondifferentiable minimization
cites work: Q4718793
cites work: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
cites work: Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
cites work: Learning Theory
cites work: On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
cites work: A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
cites work: The Group Lasso for Logistic Regression
cites work: Polynomial-time decomposition algorithms for support vector machines
cites work: Q3093368
cites work: On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
cites work: Error bounds and convergence analysis of feasible descent methods: A general approach
cites work: Iterative Solution of Nonlinear Equations in Several Variables
cites work: Algorithms for the least distance problem
cites work: Linear time algorithms for some separable quadratic programming problems
cites work: An O(n) algorithm for quadratic knapsack problems
cites work: On linear-time algorithms for the continuous quadratic Knapsack problem
cites work: An ϵ-Out-of-Kilter Method for Monotropic Programming
DOI: 10.1007/S10957-008-9458-3
description: scientific article; zbMATH DE number 5550745