Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization

DOI10.1007/s10107-015-0969-zzbMath1352.49032OpenAlexW2279141731MaRDI QIDQ344922

Nobuo Yamashita, Xiaoqin Hua

Publication date: 25 November 2016

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

Full work available at URL: https://doi.org/10.1007/s10107-015-0969-z

zbMATH Keywords

nonsmooth optimizationerror boundslinear convergenceblock coordinate proximal gradient methods

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)

Related Items

The convergence properties of infeasible inexact proximal alternating linearized minimization, Testing and non-linear preconditioning of the proximal point method, Emergence of price-taking behavior, Blocks of coordinates, stochastic programming, and markets

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• A coordinate gradient descent method for nonsmooth separable minimization
• Introductory lectures on convex optimization. A basic course.
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Pathwise coordinate optimization
• Coordinate descent algorithms for lasso penalized regression
• Accelerated Block-coordinate Relaxation for Regularized Optimization
• A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• The Group Lasso for Logistic Regression
• On the Implementation of a Primal-Dual Interior Point Method
• On the Solution of Large Quadratic Programming Problems with Bound Constraints
• Atomic Decomposition by Basis Pursuit
• Model Selection and Estimation in Regression with Grouped Variables
• Convergence of a block coordinate descent method for nondifferentiable minimization