A coordinate gradient descent method for nonsmooth separable minimization

DOI10.1007/S10107-007-0170-0zbMath1166.90016OpenAlexW2039050532MaRDI QIDQ959979

Publication date: 16 December 2008

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-007-0170-0

zbMATH Keywords

global convergence nonsmooth optimization error bound coordinate descent linear convergence rate

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Decomposition methods (49M27) Methods of successive quadratic programming type (90C55)

Related Items (only showing first 100 items - show all)

An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems ⋮ Sparse group Lasso and high dimensional multinomial classification ⋮ Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization ⋮ Nonparametric additive model with grouped Lasso and maximizing area under the ROC curve ⋮ Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems ⋮ On some steplength approaches for proximal algorithms ⋮ A convergent decomposition method for box-constrained optimization problems ⋮ Inexact coordinate descent: complexity and preconditioning ⋮ Second order semi-smooth proximal Newton methods in Hilbert spaces ⋮ Dynamical modeling for non-Gaussian data with high-dimensional sparse ordinary differential equations ⋮ A truncated Newton algorithm for nonconvex sparse recovery ⋮ A flexible coordinate descent method ⋮ Split Bregman algorithms for multiple measurement vector problem ⋮ Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization ⋮ Practical inexact proximal quasi-Newton method with global complexity analysis ⋮ Kurdyka-Łojasiewicz exponent via inf-projection ⋮ Visualizing the effects of a changing distance on data using continuous embeddings ⋮ Inertial alternating direction method of multipliers for non-convex non-smooth optimization ⋮ A regularized semi-smooth Newton method with projection steps for composite convex programs ⋮ A joint estimation approach to sparse additive ordinary differential equations ⋮ A unified approach to error bounds for structured convex optimization problems ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ A globally convergent algorithm for nonconvex optimization based on block coordinate update ⋮ Orbital minimization method with \(\ell^{1}\) regularization ⋮ Block coordinate descent algorithms for large-scale sparse multiclass classification ⋮ \(\ell_{1}\)-penalization for mixture regression models ⋮ Primal path algorithm for compositional data analysis ⋮ Nonmonotone gradient methods for vector optimization with a portfolio optimization application ⋮ X-ray CT image reconstruction via wavelet frame based regularization and Radon domain inpainting ⋮ Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions ⋮ Synchronous parallel block coordinate descent method for nonsmooth convex function minimization ⋮ A proximal interior point algorithm with applications to image processing ⋮ Variable selection for sparse Dirichlet-multinomial regression with an application to microbiome data analysis ⋮ Majorization-minimization algorithms for nonsmoothly penalized objective functions ⋮ On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes ⋮ A block coordinate gradient descent method for regularized convex separable optimization and covariance selection ⋮ Robust least square semidefinite programming with applications ⋮ On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems ⋮ Solution path clustering with adaptive concave penalty ⋮ Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights ⋮ A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints ⋮ The 2-coordinate descent method for solving double-sided simplex constrained minimization problems ⋮ (Robust) edge-based semidefinite programming relaxation of sensor network localization ⋮ Blocks of coordinates, stochastic programming, and markets ⋮ Stochastic block-coordinate gradient projection algorithms for submodular maximization ⋮ Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing ⋮ Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing ⋮ A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares ⋮ Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization ⋮ Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs ⋮ On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization ⋮ A new generalized shrinkage conjugate gradient method for sparse recovery ⋮ On the complexity analysis of randomized block-coordinate descent methods ⋮ A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property ⋮ Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup ⋮ An inexact PAM method for computing Wasserstein barycenter with unknown supports ⋮ An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization ⋮ Inexact variable metric stochastic block-coordinate descent for regularized optimization ⋮ Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing ⋮ GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression ⋮ Oracle inequalities for sparse additive quantile regression in reproducing kernel Hilbert space ⋮ A coordinate gradient descent method for nonsmooth separable minimization ⋮ Incrementally updated gradient methods for constrained and regularized optimization ⋮ Iteration complexity analysis of block coordinate descent methods ⋮ SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality ⋮ A new spectral method for \(l_1\)-regularized minimization ⋮ A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization ⋮ A proximal gradient descent method for the extended second-order cone linear complementarity problem ⋮ A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training ⋮ An iterative approach for cone complementarity problems for nonsmooth dynamics ⋮ An augmented Lagrangian approach for sparse principal component analysis ⋮ Multi-objective isogeometric integrated optimization for shape control of piezoelectric functionally graded plates ⋮ Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems ⋮ Nonconvex proximal incremental aggregated gradient method with linear convergence ⋮ Kurdyka-Łojasiewicz property of zero-norm composite functions ⋮ Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods ⋮ Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM ⋮ Globalized inexact proximal Newton-type methods for nonconvex composite functions ⋮ A Stochastic Quasi-Newton Method for Large-Scale Optimization ⋮ On the linear convergence of forward-backward splitting method. I: Convergence analysis ⋮ A block coordinate variable metric linesearch based proximal gradient method ⋮ Linearity identification for general partial linear single-index models ⋮ A new convergence analysis for the Volterra series representation of nonlinear systems ⋮ Penalized Estimation of Directed Acyclic Graphs From Discrete Data ⋮ Main effects and interactions in mixed and incomplete data frames ⋮ Spatial Variable Selection and An Application to Virginia Lyme Disease Emergence ⋮ Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization ⋮ Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method ⋮ A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization ⋮ Markov chain block coordinate descent ⋮ Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization ⋮ The generalized equivalence of regularization and min-max robustification in linear mixed models ⋮ Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems ⋮ Distributed block-diagonal approximation methods for regularized empirical risk minimization ⋮ Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs ⋮ High-performance statistical computing in the computing environments of the 2020s ⋮ Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity ⋮ Nomonotone spectral gradient method for sparse recovery ⋮ Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis ⋮ A second-order method for strongly convex \(\ell _1\)-regularization problems

Uses Software

Cites Work

This page was built for publication: A coordinate gradient descent method for nonsmooth separable minimization