Parallel subgradient method for nonsmooth convex optimization with a simple constraint

MaRDI QIDQ3454624zbMATH OpenFDO

Authors Kazuhiro Hishinuma, Hideaki Iiduka

Publication date 25 November 2015

Full work available at URL http://www.yokohamapublishers.jp/online2/oplna/vol1/p67.html

zbMATH Keywords

nonsmooth convex optimizationparallel optimization algorithmsubgradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
• Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
• Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
• Quasi-monotone subgradient methods for nonsmooth convex minimization
• A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems

Cited in

(13)

• Synchronous parallel block coordinate descent method for nonsmooth convex function minimization
• Quasi-monotone subgradient methods for nonsmooth convex minimization
• A syncro-parallel nonsmooth PGD algorithm for nonsmooth optimization
• A parallel line search subspace correction method for composite convex optimization
• Parallel subgradient methods for convex optimization.
• A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
• Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
• A parallel bundle framework for asynchronous subspace optimization of nonsmooth convex functions
• A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
• Parallel Nesterov's method for large-scale minimization of partially separable functions
• An asynchronous subgradient-proximal method for solving additive convex optimization problems
• Nonsmooth projection-free optimization with functional constraints
• Two parallel distribution algorithms for convex constrained minimization problems

This page was built for publication: Parallel subgradient method for nonsmooth convex optimization with a simple constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454624)